|
Search the dblp DataBase
Scott A. Vanstone:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Shuhong Gao, Scott A. Vanstone
On orders of optimal normal basis generators. [Citation Graph (0, 0)][DBLP] ANTS, 1994, pp:220- [Conf]
- Alfred Menezes, Scott A. Vanstone
The Implementation of Elliptic Curve Cryptosystems. [Citation Graph (0, 0)][DBLP] AUSCRYPT, 1990, pp:2-13 [Conf]
- Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone
Computing Logarithms in GF(2n). [Citation Graph (0, 0)][DBLP] CRYPTO, 1984, pp:73-82 [Conf]
- Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. [Citation Graph (0, 0)][DBLP] CRYPTO, 2001, pp:190-200 [Conf]
- Kenji Koyama, Ueli M. Maurer, Tatsuaki Okamoto, Scott A. Vanstone
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn. [Citation Graph (0, 0)][DBLP] CRYPTO, 1991, pp:252-266 [Conf]
- Douglas R. Stinson, Scott A. Vanstone
A Combinatorial Approach to Threshold Schemes. [Citation Graph (0, 0)][DBLP] CRYPTO, 1987, pp:330-339 [Conf]
- Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
An Interactive Data Exchange Protocol Based on Discrete Exponentiation. [Citation Graph (0, 0)][DBLP] EUROCRYPT, 1988, pp:159-166 [Conf]
- Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
Fast Exponentiation in GF(2n). [Citation Graph (0, 0)][DBLP] EUROCRYPT, 1988, pp:251-255 [Conf]
- Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
A Fast Elliptic Curve Cryptosystem. [Citation Graph (0, 0)][DBLP] EUROCRYPT, 1989, pp:706-708 [Conf]
- Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
On the Development of a Fast Elliptic Curve Cryptosystem. [Citation Graph (0, 0)][DBLP] EUROCRYPT, 1992, pp:482-487 [Conf]
- Greg Harper, Alfred Menezes, Scott A. Vanstone
Public-Key Cryptosystems with Very Small Key Length. [Citation Graph (0, 0)][DBLP] EUROCRYPT, 1992, pp:163-173 [Conf]
- Daniel R. L. Brown, Robert P. Gallant, Scott A. Vanstone
Provably Secure Implicit Certificate Schemes. [Citation Graph (0, 0)][DBLP] Financial Cryptography, 2001, pp:147-156 [Conf]
- Leon A. Pintsov, Scott A. Vanstone
Postal Revenue Collection in the Digital Age. [Citation Graph (0, 0)][DBLP] Financial Cryptography, 2000, pp:105-120 [Conf]
- Charles C. Y. Lam, Guang Gong, Scott A. Vanstone
Message Authentication Codes with Error Correcting Capabilities. [Citation Graph (0, 0)][DBLP] ICICS, 2002, pp:354-366 [Conf]
- Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone
Some Computational Aspects of Root Finding in GF(qm). [Citation Graph (0, 0)][DBLP] ISSAC, 1988, pp:259-270 [Conf]
- Adrian Antipa, Daniel R. L. Brown, Alfred Menezes, René Struik, Scott A. Vanstone
Validation of Elliptic Curve Public Keys. [Citation Graph (0, 0)][DBLP] Public Key Cryptography, 2003, pp:211-223 [Conf]
- Adrian Antipa, Daniel R. L. Brown, Robert P. Gallant, Robert J. Lambert, René Struik, Scott A. Vanstone
Accelerated Verification of ECDSA Signatures. [Citation Graph (0, 0)][DBLP] Selected Areas in Cryptography, 2005, pp:307-318 [Conf]
- Alfred Menezes, Scott A. Vanstone, Tatsuaki Okamoto
Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field [Citation Graph (0, 0)][DBLP] STOC, 1991, pp:80-89 [Conf]
- Therese C. Y. Lee, Scott A. Vanstone
Subspaces and Polynomial Fatorizations over Finite Fields. [Citation Graph (0, 0)][DBLP] Appl. Algebra Eng. Commun. Comput., 1995, v:6, n:, pp:147-157 [Journal]
- Alfred Menezes, Scott A. Vanstone
A Note on Cycloc Groups, Finite Fields, and the Discrete Logarithm Problem. [Citation Graph (0, 0)][DBLP] Appl. Algebra Eng. Commun. Comput., 1992, v:3, n:, pp:67-74 [Journal]
- Endre Boros, Dieter Jungnickel, Scott A. Vanstone
The existence of non-trivial hyperfactorization of K2n. [Citation Graph (0, 0)][DBLP] Combinatorica, 1991, v:11, n:1, pp:9-15 [Journal]
- Paul J. Schellenberg, Douglas R. Stinson, Scott A. Vanstone, J. W. Yates
The existence of Howell designs of side n+1 and order 2n. [Citation Graph (0, 0)][DBLP] Combinatorica, 1981, v:1, n:3, pp:289-301 [Journal]
- Scott A. Vanstone
Next generation security for wireless: elliptic curve cryptography. [Citation Graph (0, 0)][DBLP] Computers & Security, 2003, v:22, n:5, pp:412-415 [Journal]
- Dieter Jungnickel, Marialuisa J. de Resmini, Scott A. Vanstone
Codes Based on Complete Graphs. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1996, v:8, n:1-2, pp:159-165 [Journal]
- Neal Koblitz, Alfred Menezes, Scott A. Vanstone
The State of Elliptic Curve Cryptography. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2000, v:19, n:2/3, pp:173-193 [Journal]
- Laurie Law, Alfred Menezes, Minghua Qu, Jerry Solinas, Scott A. Vanstone
An Efficient Protocol for Authenticated Key Agreement. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2003, v:28, n:2, pp:119-134 [Journal]
- Volker Müller, Scott A. Vanstone, Robert J. Zuccherato
Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1998, v:14, n:2, pp:159-178 [Journal]
- Don Johnson, Alfred Menezes, Scott A. Vanstone
The Elliptic Curve Digital Signature Algorithm (ECDSA). [Citation Graph (0, 0)][DBLP] Int. J. Inf. Sec., 2001, v:1, n:1, pp:36-63 [Journal]
- Ryoh Fuji-Hara, Scott A. Vanstone
The existence of orthogonal resolutions of lines in AG(n, q). [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1987, v:45, n:1, pp:139-147 [Journal]
- Ryoh Fuji-Hara, Scott A. Vanstone
Hyperplane skew resolutions and their applications. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1988, v:47, n:1, pp:134-144 [Journal]
- Marshall Hall Jr., Robert Roth, G. H. John van Rees, Scott A. Vanstone
On designs (22, 33, 12, 8, 4). [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1988, v:47, n:2, pp:157-175 [Journal]
- Dieter Jungnickel, Scott A. Vanstone
On resolvable designs S3(3; 4, v). [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1986, v:43, n:2, pp:334-337 [Journal]
- Esther R. Lamken, W. H. Mills, Ronald C. Mullin, Scott A. Vanstone
Coverings of Pairs by Quintuples. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1987, v:44, n:1, pp:49-68 [Journal]
- Esther R. Lamken, Scott A. Vanstone
The existence of skew Howell designs of side 2n and order 2n + 2. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1990, v:54, n:1, pp:20-40 [Journal]
- Kevin T. Phelps, Scott A. Vanstone
Isomorphism of strong starters in cyclic groups. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1991, v:57, n:2, pp:287-293 [Journal]
- Scott A. Vanstone
Pairwise "Orthogonal Generalized Room Squares" and Equidistant Permutation Arrays. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1978, v:25, n:1, pp:84-89 [Journal]
- Scott A. Vanstone, Paul J. Schellenberg
A Construction for Equidistant Permutation Arrays of Index One. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1977, v:23, n:2, pp:180-186 [Journal]
- Gordon B. Agnew, Thomas Beth, Ronald C. Mullin, Scott A. Vanstone
Arithmetic Operations in GF(2m). [Citation Graph (0, 0)][DBLP] J. Cryptology, 1993, v:6, n:1, pp:3-13 [Journal]
- Gordon B. Agnew, Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone
An Implementation for a Fast Public-Key Cryptosystem. [Citation Graph (0, 0)][DBLP] J. Cryptology, 1991, v:3, n:2, pp:63-79 [Journal]
- Minghua Qu, Scott A. Vanstone
Factorizations in the Elementary Abelian p-Group and Their Cryptographic Significance. [Citation Graph (0, 0)][DBLP] J. Cryptology, 1994, v:7, n:4, pp:201-212 [Journal]
- Alfred Menezes, Scott A. Vanstone
Elliptic Curve Cryptosystems and Their Implementations. [Citation Graph (0, 0)][DBLP] J. Cryptology, 1993, v:6, n:4, pp:209-224 [Journal]
- Scott A. Vanstone, Robert J. Zuccherato
Short RSA Keys and Their Generation. [Citation Graph (0, 0)][DBLP] J. Cryptology, 1995, v:8, n:2, pp:101-114 [Journal]
- Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
An Implementation of Elliptic Curve Cryptosystems Over F2155. [Citation Graph (0, 0)][DBLP] IEEE Journal on Selected Areas in Communications, 1993, v:11, n:5, pp:804-813 [Journal]
- Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone
Improving the parallelized Pollard lambda search on anomalous binary curves. [Citation Graph (0, 0)][DBLP] Math. Comput., 2000, v:69, n:232, pp:1699-1705 [Journal]
- Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone
Subgroup Refinement Algorithms for Root Finding in GF(q). [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:2, pp:228-239 [Journal]
- Albrecht Beutelspacher, Dieter Jungnickel, Paul C. van Oorschot, Scott A. Vanstone
Pair-Splitting Sets in AG(m, q). [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1992, v:5, n:4, pp:451-459 [Journal]
- Douglas R. Stinson, Scott A. Vanstone
A Combinatorial Approach to Threshold Schemes. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1988, v:1, n:2, pp:230-236 [Journal]
- Dieter Jungnickel, Scott A. Vanstone
Graphical codes revisited. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:136-146 [Journal]
- Alfred Menezes, Tatsuaki Okamoto, Scott A. Vanstone
Reducing elliptic curve logarithms to logarithms in a finite field. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1639-1646 [Journal]
- Paul C. van Oorschot, Scott A. Vanstone
A geometric approach to root finding in GF(qm). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:2, pp:444-453 [Journal]
- Scott A. Vanstone, Robert J. Zuccherato
Elliptic curve cryptosystems using curves of smooth order over the ring Zn. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1231-1237 [Journal]
- Ronald C. Mullin, Paul J. Schellenberg, Scott A. Vanstone, W. D. Wallis
On the existence of frames. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1981, v:37, n:1, pp:79-104 [Journal]
- Ryoh Fuji-Hara, Scott A. Vanstone
Orthogonal resolutions of lines in AG(n, q). [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:41, n:1, pp:17-28 [Journal]
- Douglas R. Stinson, Scott A. Vanstone
A Kirkman square of order 51 and block size 3. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1985, v:55, n:1, pp:107-111 [Journal]
- W. L. Kocay, Douglas R. Stinson, Scott A. Vanstone
On strong starters in cyclic groups. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1985, v:56, n:1, pp:45-60 [Journal]
- Esther R. Lamken, Scott A. Vanstone
Existence results for KS3(v; 2, 4)s. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1986, v:62, n:2, pp:197-210 [Journal]
- D. J. Curran, Scott A. Vanstone
Doubly resolvable designs from generalized Bhaskar Rao designs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1989, v:73, n:1-2, pp:49-63 [Journal]
- Kevin T. Phelps, Douglas R. Stinson, Scott A. Vanstone
The existence of simple S3(3, 4, v). [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1989, v:77, n:1-3, pp:255-258 [Journal]
- Esther R. Lamken, Scott A. Vanstone
Balanced tournament designs and related topics. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1989, v:77, n:1-3, pp:159-176 [Journal]
- Dieter Jungnickel, Scott A. Vanstone
q-ary graphical codes. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:208, n:, pp:375-386 [Journal]
- Esther R. Lamken, Scott A. Vanstone
Balanced tournament designs and resolvable (upsilon, 3, 2)-bibds. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:83, n:1, pp:37-47 [Journal]
- Paul C. van Oorschot, Scott A. Vanstone
On splitting sets in block designs and finding roots of polynomials. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:84, n:1, pp:71-85 [Journal]
- Esther R. Lamken, Rolf S. Rees, Scott A. Vanstone
Class-uniformly resolvable pairwise balanced designs with block sizes two and three. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:92, n:1-3, pp:197-209 [Journal]
- Dieter Jungnickel, Scott A. Vanstone
Triple systems in PG(2, q). [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:92, n:1-3, pp:131-135 [Journal]
- Brendan D. McKay, Jennifer Seberry, Scott A. Vanstone
Ralph Gordon Stanton. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:92, n:1-3, pp:1-8 [Journal]
- Dieter Jungnickel, Ronald C. Mullin, Scott A. Vanstone
The spectrum of alpha-resolvable block designs with block size 3. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:97, n:1-3, pp:269-277 [Journal]
- Vladimir D. Tonchev, Scott A. Vanstone
On Kirkman triple systems of order 33. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:106, n:, pp:493-496 [Journal]
- Esther R. Lamken, Scott A. Vanstone
Existence results for doubly near resolvable (upsilon, 3, 2)-BIBDs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:120, n:1-3, pp:135-148 [Journal]
Optimal normal bases in GF(pn). [Citation Graph (, )][DBLP]
Low complexity normal bases. [Citation Graph (, )][DBLP]
Search in 0.046secs, Finished in 0.051secs
|