Embedding (r, 1)-designs in finite projective planes. - David McCarthy; Scott A. Vanstone (Discret. Math., 1977)

A Construction for Equidistant Permutation Arrays of Index One. - Scott A. Vanstone; Paul J. Schellenberg (J. Comb. Theory A, 1977)

Extremal (r, λ)-designs. - Scott A. Vanstone (Discret. Math., 1978)

Pairwise "Orthogonal Generalized Room Squares" and Equidistant Permutation Arrays. - Scott A. Vanstone (J. Comb. Theory A, 1978)

On the structure of regular pairwise balanced designs. - David McCarthy; Scott A. Vanstone (Discret. Math., 1979)

On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays. - Rudolf Mathon; Scott A. Vanstone (Discret. Math., 1980)

Doubly resolvable designs. - Scott A. Vanstone (Discret. Math., 1980)

Transversal Designs and Doubly-resolvable Designs. - Ryoh Fuji-Hara; Scott A. Vanstone (Eur. J. Comb., 1980)

The existence of Howell designs of side n+1 and order 2n. - Paul J. Schellenberg; Douglas R. Stinson; Scott A. Vanstone; J. W. Yates (Comb., 1981)

On the existence of frames. - Ronald C. Mullin; Paul J. Schellenberg; Scott A. Vanstone; W. D. Wallis (Discret. Math., 1981)

Orthogonal resolutions of lines in AG(n, q). - Ryoh Fuji-Hara; Scott A. Vanstone (Discret. Math., 1982)

Computing Logarithms in GF(2n). - Ian F. Blake; Ronald C. Mullin; Scott A. Vanstone (CRYPTO, 1984)

On strong starters in cyclic groups. - William L. Kocay; Douglas R. Stinson; Scott A. Vanstone (Discret. Math., 1985)

A Kirkman square of order 51 and block size 3. - Douglas R. Stinson; Scott A. Vanstone (Discret. Math., 1985)

Existence results for KS3(v; 2, 4)s. - Esther R. Lamken; Scott A. Vanstone (Discret. Math., 1986)

Designs With Mutually Orthogonal Resolutions. - Esther R. Lamken; Scott A. Vanstone (Eur. J. Comb., 1986)

On resolvable designs S3(3; 4, v). - Dieter Jungnickel; Scott A. Vanstone (J. Comb. Theory A, 1986)

The existence of orthogonal resolutions of lines in AG(n, q). - Ryoh Fuji-Hara; Scott A. Vanstone (J. Comb. Theory A, 1987)

Coverings of Pairs by Quintuples. - Esther R. Lamken; W. H. Mills; Ronald C. Mullin; Scott A. Vanstone (J. Comb. Theory A, 1987)

An Interactive Data Exchange Protocol Based on Discrete Exponentiation. - Gordon B. Agnew; Ronald C. Mullin; Scott A. Vanstone (EUROCRYPT, 1988)

Fast Exponentiation in GF(2n). - Gordon B. Agnew; Ronald C. Mullin; Scott A. Vanstone (EUROCRYPT, 1988)

Some Computational Aspects of Root Finding in GF(qm). - Alfred Menezes; Paul C. van Oorschot; Scott A. Vanstone (ISSAC, 1988)

Orthogonal resolutions in odd balanced tournament designs. - Esther R. Lamken; Scott A. Vanstone (Graphs Comb., 1988)

Hyperplane skew resolutions and their applications. - Ryoh Fuji-Hara; Scott A. Vanstone (J. Comb. Theory A, 1988)

On designs (22, 33, 12, 8, 4). - Marshall Hall Jr.; Robert Roth; G. H. John van Rees; Scott A. Vanstone (J. Comb. Theory A, 1988)

A Combinatorial Approach to Threshold Schemes. - Douglas R. Stinson; Scott A. Vanstone (SIAM J. Discret. Math., 1988)

A Fast Elliptic Curve Cryptosystem. - Gordon B. Agnew; Ronald C. Mullin; Scott A. Vanstone (EUROCRYPT, 1989)

Low complexity normal bases. - David W. Ash; Ian F. Blake; Scott A. Vanstone (Discret. Appl. Math., 1989)

Optimal normal bases in GF(pn). - Ronald C. Mullin; I. M. Onyszchuk; Scott A. Vanstone; R. M. Wilson (Discret. Appl. Math., 1989)

Doubly resolvable designs from generalized Bhaskar Rao designs. - D. J. Curran; Scott A. Vanstone (Discret. Math., 1989)

Balanced tournament designs and related topics. - Esther R. Lamken; Scott A. Vanstone (Discret. Math., 1989)

The existence of simple S3(3, 4, v). - Kevin T. Phelps; Douglas R. Stinson; Scott A. Vanstone (Discret. Math., 1989)

A geometric approach to root finding in GF(qm). - Paul C. van Oorschot; Scott A. Vanstone (IEEE Trans. Inf. Theory, 1989)

The Implementation of Elliptic Curve Cryptosystems. - Alfred Menezes; Scott A. Vanstone (AUSCRYPT, 1990)

Balanced tournament designs and resolvable (upsilon, 3, 2)-bibds. - Esther R. Lamken; Scott A. Vanstone (Discret. Math., 1990)

On splitting sets in block designs and finding roots of polynomials. - Paul C. van Oorschot; Scott A. Vanstone (Discret. Math., 1990)

The existence of skew Howell designs of side 2n and order 2n + 2. - Esther R. Lamken; Scott A. Vanstone (J. Comb. Theory A, 1990)

New Public-Key Schemes Based on Elliptic Curves over the Ring Zn. - Kenji Koyama; Ueli M. Maurer; Tatsuaki Okamoto; Scott A. Vanstone (CRYPTO, 1991)

The existence of non-trivial hyperfactorization of K2n. - Endre Boros; Dieter Jungnickel; Scott A. Vanstone (Comb., 1991)

The spectrum of alpha-resolvable block designs with block size 3. - Dieter Jungnickel; Ronald C. Mullin; Scott A. Vanstone (Discret. Math., 1991)

Triple systems in PG(2, q). - Dieter Jungnickel; Scott A. Vanstone (Discret. Math., 1991)

Class-uniformly resolvable pairwise balanced designs with block sizes two and three. - Esther R. Lamken; Rolf S. Rees; Scott A. Vanstone (Discret. Math., 1991)

Ralph Gordon Stanton. - Brendan D. McKay; Jennifer Seberry; Scott A. Vanstone (Discret. Math., 1991)

Isomorphism of strong starters in cyclic groups. - Kevin T. Phelps; Scott A. Vanstone (J. Comb. Theory A, 1991)

An Implementation for a Fast Public-Key Cryptosystem. - Gordon B. Agnew; Ronald C. Mullin; I. M. Onyszchuk; Scott A. Vanstone (J. Cryptol., 1991)

On the Development of a Fast Elliptic Curve Cryptosystem. - Gordon B. Agnew; Ronald C. Mullin; Scott A. Vanstone (EUROCRYPT, 1992)

Public-Key Cryptosystems with Very Small Key Length. - Greg Harper; Alfred Menezes; Scott A. Vanstone (EUROCRYPT, 1992)

A Note on Cycloc Groups, Finite Fields, and the Discrete Logarithm Problem. - Alfred Menezes; Scott A. Vanstone (Appl. Algebra Eng. Commun. Comput., 1992)

On Kirkman triple systems of order 33. - Vladimir D. Tonchev; Scott A. Vanstone (Discret. Math., 1992)

Subgroup Refinement Algorithms for Root Finding in GF(q). - Alfred Menezes; Paul C. van Oorschot; Scott A. Vanstone (SIAM J. Comput., 1992)

Pair-Splitting Sets in AG(m, q). - Albrecht Beutelspacher; Dieter Jungnickel; Paul C. van Oorschot; Scott A. Vanstone (SIAM J. Discret. Math., 1992)

Existence results for doubly near resolvable (upsilon, 3, 2)-BIBDs. - Esther R. Lamken; Scott A. Vanstone (Discret. Math., 1993)

Arithmetic Operations in GF(2m). - Gordon B. Agnew; Thomas Beth; Ronald C. Mullin; Scott A. Vanstone (J. Cryptol., 1993)

Elliptic Curve Cryptosystems and Their Implementations. - Alfred Menezes; Scott A. Vanstone (J. Cryptol., 1993)

An Implementation of Elliptic Curve Cryptosystems Over F2155. - Gordon B. Agnew; Ronald C. Mullin; Scott A. Vanstone (IEEE J. Sel. Areas Commun., 1993)

Reducing elliptic curve logarithms to logarithms in a finite field. - Alfred Menezes; Tatsuaki Okamoto; Scott A. Vanstone (IEEE Trans. Inf. Theory, 1993)

On orders of optimal normal basis generators. - Shuhong Gao; Scott A. Vanstone (ANTS, 1994)

Factorizations in the Elementary Abelian p-Group and Their Cryptographic Significance. - Minghua Qu; Scott A. Vanstone (J. Cryptol., 1994)

Subspaces and polynomial factorizations over finite fields. - Therese C. Y. Lee; Scott A. Vanstone (Appl. Algebra Eng. Commun. Comput., 1995)

Short RSA Keys and Their Generation. - Scott A. Vanstone; Robert J. Zuccherato (J. Cryptol., 1995)

Handbook of Applied Cryptography - Alfred Menezes; Paul C. van Oorschot; Scott A. Vanstone (CRC Press, 1996)

Codes Based on Complete Graphs. - Dieter Jungnickel; Marialuisa J. de Resmini; Scott A. Vanstone (Des. Codes Cryptogr., 1996)

Elliptic curve cryptosystem - The answer to strong, fast public-key cryptography for securing constrained environments. - Scott A. Vanstone (Inf. Secur. Tech. Rep., 1997)

Graphical codes revisited. - Dieter Jungnickel; Scott A. Vanstone (IEEE Trans. Inf. Theory, 1997)

Elliptic curve cryptosystems using curves of smooth order over the ring Zn. - Scott A. Vanstone; Robert J. Zuccherato (IEEE Trans. Inf. Theory, 1997)

Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2. - Volker Müller 001; Scott A. Vanstone; Robert J. Zuccherato (Des. Codes Cryptogr., 1998)

q-ary graphical codes. - Dieter Jungnickel; Scott A. Vanstone (Discret. Math., 1999)

Postal Revenue Collection in the Digital Age. - Leon A. Pintsov; Scott A. Vanstone (Financial Cryptography, 2000)

The State of Elliptic Curve Cryptography. - Neal Koblitz; Alfred Menezes; Scott A. Vanstone (Des. Codes Cryptogr., 2000)

Improving the parallelized Pollard lambda search on anomalous binary curves. - Robert P. Gallant; Robert J. Lambert; Scott A. Vanstone (Math. Comput., 2000)

Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. - Robert P. Gallant; Robert J. Lambert; Scott A. Vanstone (CRYPTO, 2001)

Provably Secure Implicit Certificate Schemes. - Daniel R. L. Brown; Robert P. Gallant; Scott A. Vanstone (Financial Cryptography, 2001)

The Elliptic Curve Digital Signature Algorithm (ECDSA). - Don Johnson; Alfred Menezes; Scott A. Vanstone (Int. J. Inf. Sec., 2001)

Message Authentication Codes with Error Correcting Capabilities. - Charles C. Y. Lam; Guang Gong; Scott A. Vanstone (ICICS, 2002)

Validation of Elliptic Curve Public Keys. - Adrian Antipa; Daniel R. L. Brown; Alfred Menezes; René Struik; Scott A. Vanstone (Public Key Cryptography, 2003)

Next generation security for wireless: elliptic curve cryptography. - Scott A. Vanstone (Comput. Secur., 2003)

An Efficient Protocol for Authenticated Key Agreement. - Laurie Law; Alfred Menezes; Minghua Qu; Jerome A. Solinas; Scott A. Vanstone (Des. Codes Cryptogr., 2003)

Accelerated Verification of ECDSA Signatures. - Adrian Antipa; Daniel R. L. Brown; Robert P. Gallant; Robert J. Lambert; René Struik; Scott A. Vanstone (Selected Areas in Cryptography, 2005)

Security of ECQV-Certified ECDSA Against Passive Adversaries. - Daniel R. L. Brown; Matthew J. Campagna; Scott A. Vanstone (IACR Cryptol. ePrint Arch., 2009)