Scott A. Vanstone

Publication Activity (10 Years)

Years Active: 1977-2009
Publications (10 Years): 0

Publications

Daniel R. L. Brown, Matthew J. Campagna, Scott A. Vanstone
Security of ECQV-Certified ECDSA Against Passive Adversaries. IACR Cryptol. ePrint Arch. 2009 (2009)
Adrian Antipa, Daniel R. L. Brown, Robert P. Gallant, Robert J. Lambert, René Struik, Scott A. Vanstone
Accelerated Verification of ECDSA Signatures. Selected Areas in Cryptography (2005)
Laurie Law, Alfred Menezes, Minghua Qu, Jerome A. Solinas, Scott A. Vanstone
An Efficient Protocol for Authenticated Key Agreement. Des. Codes Cryptogr. 28 (2) (2003)
Adrian Antipa, Daniel R. L. Brown, Alfred Menezes, René Struik, Scott A. Vanstone
Validation of Elliptic Curve Public Keys. Public Key Cryptography (2003)
Scott A. Vanstone
Next generation security for wireless: elliptic curve cryptography. Comput. Secur. 22 (5) (2003)
Charles C. Y. Lam, Guang Gong, Scott A. Vanstone
Message Authentication Codes with Error Correcting Capabilities. ICICS (2002)
Daniel R. L. Brown, Robert P. Gallant, Scott A. Vanstone
Provably Secure Implicit Certificate Schemes. Financial Cryptography (2001)
Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. CRYPTO (2001)
Don Johnson, Alfred Menezes, Scott A. Vanstone
The Elliptic Curve Digital Signature Algorithm (ECDSA). Int. J. Inf. Sec. 1 (1) (2001)
Neal Koblitz, Alfred Menezes, Scott A. Vanstone
The State of Elliptic Curve Cryptography. Des. Codes Cryptogr. 19 (2/3) (2000)
Leon A. Pintsov, Scott A. Vanstone
Postal Revenue Collection in the Digital Age. Financial Cryptography (2000)
Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone
Improving the parallelized Pollard lambda search on anomalous binary curves. Math. Comput. 69 (232) (2000)
Dieter Jungnickel, Scott A. Vanstone
q-ary graphical codes. Discret. Math. (1999)
Volker Müller, Scott A. Vanstone, Robert J. Zuccherato
Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2. Des. Codes Cryptogr. 14 (2) (1998)
Scott A. Vanstone
Elliptic curve cryptosystem - The answer to strong, fast public-key cryptography for securing constrained environments. Inf. Secur. Tech. Rep. 2 (2) (1997)
Scott A. Vanstone, Robert J. Zuccherato
. IEEE Trans. Inf. Theory 43 (4) (1997)
Dieter Jungnickel, Scott A. Vanstone
Graphical codes revisited. IEEE Trans. Inf. Theory 43 (1) (1997)
Dieter Jungnickel, Marialuisa J. de Resmini, Scott A. Vanstone
Codes Based on Complete Graphs. Des. Codes Cryptogr. 8 (1-2) (1996)
Scott A. Vanstone, Robert J. Zuccherato
Short RSA Keys and Their Generation. J. Cryptol. 8 (2) (1995)
Therese C. Y. Lee, Scott A. Vanstone
Subspaces and polynomial factorizations over finite fields. Appl. Algebra Eng. Commun. Comput. 6 (1995)
Minghua Qu, Scott A. Vanstone
Factorizations in the Elementary Abelian p-Group and Their Cryptographic Significance. J. Cryptol. 7 (4) (1994)
Shuhong Gao, Scott A. Vanstone
On orders of optimal normal basis generators. ANTS (1994)
Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
. IEEE J. Sel. Areas Commun. 11 (5) (1993)
Alfred Menezes, Scott A. Vanstone
Elliptic Curve Cryptosystems and Their Implementations. J. Cryptol. 6 (4) (1993)
Gordon B. Agnew, Thomas Beth, Ronald C. Mullin, Scott A. Vanstone
). J. Cryptol. 6 (1) (1993)
Alfred Menezes, Tatsuaki Okamoto, Scott A. Vanstone
Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inf. Theory 39 (5) (1993)
Esther R. Lamken, Scott A. Vanstone
Existence results for doubly near resolvable (upsilon, 3, 2)-BIBDs. Discret. Math. 120 (1-3) (1993)
Albrecht Beutelspacher, Dieter Jungnickel, Paul C. van Oorschot, Scott A. Vanstone
. SIAM J. Discret. Math. 5 (4) (1992)
Greg Harper, Alfred Menezes, Scott A. Vanstone
Public-Key Cryptosystems with Very Small Key Length. EUROCRYPT (1992)
Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone
Subgroup Refinement Algorithms for Root Finding in GF(q). SIAM J. Comput. 21 (2) (1992)
Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
On the Development of a Fast Elliptic Curve Cryptosystem. EUROCRYPT (1992)
Vladimir D. Tonchev, Scott A. Vanstone
On Kirkman triple systems of order 33. Discret. Math. (1992)
Alfred Menezes, Scott A. Vanstone
A Note on Cycloc Groups, Finite Fields, and the Discrete Logarithm Problem. Appl. Algebra Eng. Commun. Comput. 3 (1992)
Dieter Jungnickel, Ronald C. Mullin, Scott A. Vanstone
The spectrum of alpha-resolvable block designs with block size 3. Discret. Math. 97 (1-3) (1991)
Esther R. Lamken, Rolf S. Rees, Scott A. Vanstone
Class-uniformly resolvable pairwise balanced designs with block sizes two and three. Discret. Math. 92 (1-3) (1991)
Gordon B. Agnew, Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone
An Implementation for a Fast Public-Key Cryptosystem. J. Cryptol. 3 (2) (1991)
Endre Boros, Dieter Jungnickel, Scott A. Vanstone
. Comb. 11 (1) (1991)
Dieter Jungnickel, Scott A. Vanstone
Triple systems in PG(2, q). Discret. Math. 92 (1-3) (1991)
Brendan D. McKay, Jennifer Seberry, Scott A. Vanstone
Ralph Gordon Stanton. Discret. Math. 92 (1-3) (1991)
Kenji Koyama, Ueli M. Maurer, Tatsuaki Okamoto, Scott A. Vanstone
. CRYPTO (1991)
Alfred Menezes, Scott A. Vanstone, Tatsuaki Okamoto
Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field STOC (1991)
Kevin T. Phelps, Scott A. Vanstone
Isomorphism of strong starters in cyclic groups. J. Comb. Theory, Ser. A 57 (2) (1991)
Alfred Menezes, Scott A. Vanstone
The Implementation of Elliptic Curve Cryptosystems. AUSCRYPT (1990)
Esther R. Lamken, Scott A. Vanstone
+ 2. J. Comb. Theory, Ser. A 54 (1) (1990)
Esther R. Lamken, Scott A. Vanstone
Balanced tournament designs and resolvable (upsilon, 3, 2)-bibds. Discret. Math. 83 (1) (1990)
Paul C. van Oorschot, Scott A. Vanstone
On splitting sets in block designs and finding roots of polynomials. Discret. Math. 84 (1) (1990)
Paul C. van Oorschot, Scott A. Vanstone
). IEEE Trans. Inf. Theory 35 (2) (1989)
Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
A Fast Elliptic Curve Cryptosystem. EUROCRYPT (1989)
Kevin T. Phelps, Douglas R. Stinson, Scott A. Vanstone
(3, 4, v). Discret. Math. 77 (1-3) (1989)
Esther R. Lamken, Scott A. Vanstone
Balanced tournament designs and related topics. Discret. Math. 77 (1-3) (1989)
Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone, R. M. Wilson
). Discret. Appl. Math. 22 (2) (1989)
David W. Ash, Ian F. Blake, Scott A. Vanstone
Low complexity normal bases. Discret. Appl. Math. 25 (3) (1989)
D. J. Curran, Scott A. Vanstone
Doubly resolvable designs from generalized Bhaskar Rao designs. Discret. Math. 73 (1-2) (1989)
Marshall Hall Jr., Robert Roth, G. H. John van Rees, Scott A. Vanstone
On designs (22, 33, 12, 8, 4). J. Comb. Theory, Ser. A 47 (2) (1988)
Esther R. Lamken, Scott A. Vanstone
Orthogonal resolutions in odd balanced tournament designs. Graphs Comb. 4 (1) (1988)
Ryoh Fuji-Hara, Scott A. Vanstone
Hyperplane skew resolutions and their applications. J. Comb. Theory, Ser. A 47 (1) (1988)
Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone
). ISSAC (1988)
Douglas R. Stinson, Scott A. Vanstone
A Combinatorial Approach to Threshold Schemes. SIAM J. Discret. Math. 1 (2) (1988)
Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
. EUROCRYPT (1988)
Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
An Interactive Data Exchange Protocol Based on Discrete Exponentiation. EUROCRYPT (1988)
Douglas R. Stinson, Scott A. Vanstone
A Combinatorial Approach to Threshold Schemes. CRYPTO (1987)
Esther R. Lamken, W. H. Mills, Ronald C. Mullin, Scott A. Vanstone
Coverings of Pairs by Quintuples. J. Comb. Theory, Ser. A 44 (1) (1987)
Ryoh Fuji-Hara, Scott A. Vanstone
). J. Comb. Theory, Ser. A 45 (1) (1987)
Esther R. Lamken, Scott A. Vanstone
(v; 2, 4)s. Discret. Math. 62 (2) (1986)
Esther R. Lamken, Scott A. Vanstone
Designs With Mutually Orthogonal Resolutions. Eur. J. Comb. 7 (3) (1986)
Dieter Jungnickel, Scott A. Vanstone
). J. Comb. Theory, Ser. A 43 (2) (1986)
William L. Kocay, Douglas R. Stinson, Scott A. Vanstone
On strong starters in cyclic groups. Discret. Math. 56 (1) (1985)
Douglas R. Stinson, Scott A. Vanstone
A Kirkman square of order 51 and block size 3. Discret. Math. 55 (1) (1985)
Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone
). CRYPTO (1984)
Ryoh Fuji-Hara, Scott A. Vanstone
Orthogonal resolutions of lines in AG(n, q). Discret. Math. 41 (1) (1982)
Ronald C. Mullin, Paul J. Schellenberg, Scott A. Vanstone, W. D. Wallis
On the existence of frames. Discret. Math. 37 (1) (1981)
Paul J. Schellenberg, Douglas R. Stinson, Scott A. Vanstone, J. W. Yates
The existence of Howell designs of side n+1 and order 2n. Comb. 1 (3) (1981)
Ryoh Fuji-Hara, Scott A. Vanstone
Transversal Designs and Doubly-resolvable Designs. Eur. J. Comb. 1 (3) (1980)
Rudolf Mathon, Scott A. Vanstone
On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays. Discret. Math. 30 (2) (1980)
Scott A. Vanstone
Doubly resolvable designs. Discret. Math. 29 (1) (1980)
David McCarthy, Scott A. Vanstone
On the structure of regular pairwise balanced designs. Discret. Math. 25 (3) (1979)
Scott A. Vanstone
Extremal (r, λ)-designs. Discret. Math. 23 (1) (1978)
Scott A. Vanstone
Pairwise "Orthogonal Generalized Room Squares" and Equidistant Permutation Arrays. J. Comb. Theory, Ser. A 25 (1) (1978)
David McCarthy, Scott A. Vanstone
Embedding (r, 1)-designs in finite projective planes. Discret. Math. 19 (1) (1977)
Scott A. Vanstone, Paul J. Schellenberg
A Construction for Equidistant Permutation Arrays of Index One. J. Comb. Theory, Ser. A 23 (2) (1977)