S. Vanstone

发表

Handbook of Applied Cryptography

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone, 2018 .

The knapsack problem in cryptography

S. Vanstone, Minghua Qu, 1994 .

Computing Logarithms in Finite Fields of Characteristic Two

S. Vanstone, I. Blake, R. Fuji-Hara, 1984 .

Improved digital signature scheme based on discrete exponentiation

S. Vanstone, R. Mullin, G. Agnew, 1990 .

The Elliptic Curve Digital Signature Algorithm (ECDSA)

Alfred Menezes, Scott Vanstone, Don Johnson, 2001, International Journal of Information Security.

An Efficient Protocol for Authenticated Key Agreement

Alfred Menezes, Scott A. Vanstone, Jerome A. Solinas, 2003, Des. Codes Cryptogr..

Advances in Cryptology: Crypto, 90 : Proceedings

J. Hartmanis, A. Menezes, S. Vanstone, 1991 .

Counting Points on Elliptic Curves Over F2m

R. Zuccherato, A. Menezes, S. Vanstone, 1993 .

Enumeration and design

S. Vanstone, D. M. Jackson, 1984 .

OPTIMAL NORMAL BASES IN GF(p”)*

S. Vanstone, R. Mullin, I. Onyszchuk, 2002 .

Factoring Polynomials over Finite Fields

S. Vanstone, I. Blake, R. Mullin, 1993 .

An application of difference sets to a problem concerning graphical codes

S. Vanstone, D. Jungnickel, 1997 .

Codes based on complete graphs

S. Vanstone, D. Jungnickel, M. D. Resmini, 1996 .

An application of coding theory to a problem in graphical enumeration

S. Vanstone, D. Jungnickel, 1995 .

Codes From Algebraic Geometry

S. Vanstone, I. Blake, R. Mullin, 1993 .

Introduction to Finite Fields and Bases

S. Vanstone, I. Blake, R. Mullin, 1993 .

On primitive polynomials over finite fields

S. Vanstone, D. Jungnickel, 1989 .

Public-Key Cryptosystems with Very Small Key

A. Menezes, S. Vanstone, Greg Harper, 1993 .

Provably Secure Implicit Certificate Schemes

Scott A. Vanstone, Daniel R. L. Brown, Robert P. Gallant, 2002, Financial Cryptography.

Elliptic Curves over Finite Fields

S. Vanstone, I. Blake, R. Mullin, 1993 .

Equidistant permutation arrays: a bound

Scott A. Vanstone, S. Vanstone, G. H. Rees, 1982, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

Conical Embeddings of Steiner systems

Scott A. Vanstone, Dieter Jungnickel, S. Vanstone, 1987 .

A generalization of a theorem of Totten

S. A. Vanstone, S. Vanstone, R. Mullin, 1976, Journal of the Australian Mathematical Society.

The Discrete Logarithm Problem

Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone, 1993 .

Construction of Irreducible Polynomials

S. Vanstone, I. Blake, R. Mullin, 1993 .

Class-uniformly resolvable pairwise balanced designs with block sizes two and three

S. Vanstone, E. Lamken, R. Rees, 1991, Discrete Mathematics.

Counting points on elliptic curves over $\bold F\sb {2\sp m}$

Alfred Menezes, Scott A. Vanstone, Robert J. Zuccherato, 1993 .

The Implementation of Elliptic Curve Cryptosystems

Alfred Menezes, Scott A. Vanstone, A. Menezes, 1990, AUSCRYPT.

Key Establishment Protocols

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone, 1996, Handbook of Applied Cryptography.

Bibliography of Papers from Selected Cryptographic Forums

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone, 1996 .

Hash Functions and Data Integrity

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone, 1996, Handbook of Applied Cryptography.

Pseudorandom Bits and Sequences

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone, 1996, Handbook of Applied Cryptography.

Key Management Techniques

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone, 1996, Handbook of Applied Cryptography.

Identification and Entity Authentication

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone, 1996, Handbook of Applied Cryptography.

Patents and Standards

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone, 1996, Handbook of Applied Cryptography.

Public-Key Encryption

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone, 1996, Handbook of Applied Cryptography.

Handbook of Applied Crytography.@@@The Crytographic Imagination: Secret Writing from Edgar Poe to the Internet.

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone, 1999 .

Ralph Gordon Stanton

Brendan D. McKay, Jennifer Seberry, Scott A. Vanstone, 1991, Discret. Math..

On the chromatic index of a finite projective space

Scott A. Vanstone, Dieter Jungnickel, Albrecht Beutelspacher, 1989 .

Recursive constructions for equidistant permutation arrays

Scott A. Vanstone, S. Vanstone, P. Schellenberg, 1977, Journal of the Australian Mathematical Society.

Fast Exponentiation in GF(2n)

Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone, 1988, EUROCRYPT.

The existence of non-trivial hyperfactorizations ofK2n

Endre Boros, Scott A. Vanstone, Dieter Jungnickel, 1991, Comb..

A process for the signature and the session key generation

Scott A. Vanstone, Alfred John Menezes, Minghua Qu, 1996 .

On the Number of Self-Dual Bases of GF(q m ) Over GF(q)

Scott A. Vanstone, Dieter Jungnickel, Alfred John Menezes, 1990 .

Arithmetic Operations in GF(2 m ).

Thomas Beth, Ronald C. Mullin, Scott A. Vanstone, 1993 .

Elliptic Curve Cryptosystems

S. Vanstone, I. Blake, R. Mullin, 1993 .

On the number of self-dual bases of ${\rm GF}(q\sp m)$ over ${\rm GF}(q)$

Scott A. Vanstone, Dieter Jungnickel, Alfred John Menezes, 1990 .

Recent results on (,) - designs and related configurations

Scott A. Vanstone, R. C. Mullin, M. Deza, 1981 .

The existence of a class of Kirkman squares of index 2

Scott A. Vanstone, E. R. Lamken, S. Vanstone, 1988, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

Orthogonal resolutions of lines in AG(n, q)

Scott A. Vanstone, Ryoh Fuji-Hara, S. Vanstone, 1982, Discret. Math..

The spectrum of alpha-resolvable block designs with block size 3

Ronald C. Mullin, Scott A. Vanstone, Dieter Jungnickel, 1991, Discret. Math..

On splitting sets in block designs and finding roots of polynomials

Paul C. van Oorschot, Scott A. Vanstone, P. V. Oorschot, 1990, Discret. Math..

Isomorphism of strong starters in cyclic groups

Kevin T. Phelps, Scott A. Vanstone, S. Vanstone, 1991, J. Comb. Theory, Ser. A.

A secure method of session key generation and authentication

Scott A. Vanstone, Alfred John Menezes, Qu Minghua, 1996 .

Recursive constructions for resolvable and doubly resolvable 1-rotational Steiner 2-designs

Masakazu Jimbo, S. Vanstone, Scott A Vanstone, 1984 .

The number of solutions to an equation arising from a problem on latin squares

Ian P. Goulden, S. A. Vanstone, S. Vanstone, 1983, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

Class‐uniformly resolvable designs with block sizes 2 and 3

S. A. Vanstone, S. Vanstone, D. Wevrick, 1996 .

The Asymptotic Behaviour of Equidistant Permutation Arrays

S. A. Vanstone, S. Vanstone, 1979, Canadian Journal of Mathematics.

EMBEDDING THE PSEUDOCOMPLEMENT OF A QUADRILATERAL IN A FINITE PROJECTIVE PLANE

S. A. Vanstone, S. Vanstone, R. Mullin, 1979 .

Pairwise Balanced Designs with Block Sizes 5t + 1

S. A. Vanstone, S. Vanstone, S. C. Furino, 2017 .

On the number of self-dual bases of (^{}) over ()

A. Menezes, S. Vanstone, D. Jungnickel, 1990 .

Guide to Elliptic Curve Cryptography

Alfred Menezes, Darrel Hankerson, Scott Vanstone, 2004, Springer Professional Computing.

Factorizations in the elementary Abelian p-group and their cryptographic significance

Scott A. Vanstone, Minghua Qu, S. Vanstone, 1994, Journal of Cryptology.

Computer Security Course Bibliography

D. Aspinall, P. V. Oorschot, A. Menezes, 2002 .

Reducing elliptic curve logarithms to logarithms in a finite field

Alfred Menezes, Tatsuaki Okamoto, Scott Vanstone, 1991, STOC '91.

Public-Key Cryptosystems with Very Small Key Length

Alfred Menezes, Scott A. Vanstone, Greg Harper, 1992, EUROCRYPT.

On the Development of a Fast Elliptic Curve Cryptosystem

Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone, 1992, EUROCRYPT.

A Fast Elliptic Curve Cryptosystem

Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone, 1990, EUROCRYPT.

An Interactive Data Exchange Protocol Based on Discrete Exponentiation

Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone, 1988, EUROCRYPT.

A Combinatorial Approach to Threshold Schemes

Douglas R. Stinson, Scott A. Vanstone, Douglas R Stinson, 1987, SIAM J. Discret. Math..

Provably Secure Implicit Certificate Schemes

Daniel R. L. Brown, S. Vanstone, R. Gallant, 2002, Financial Cryptography.

The State of Elliptic Curve Cryptography

Alfred Menezes, Scott A. Vanstone, Neal Koblitz, 2000, Des. Codes Cryptogr..

Arithmetic operations inGF(2m)

Thomas Beth, Gordon B. Agnew, Ronald C. Mullin, 1993, Journal of Cryptology.

A geometric approach to root finding in GF(qm)

Paul C. van Oorschot, Scott A. Vanstone, P. V. Oorschot, 1989, IEEE Trans. Inf. Theory.

Optimal normal bases in GF(pn)

Ronald C. Mullin, Scott A. Vanstone, I. M. Onyszchuk, 1989, Discret. Appl. Math..

The existence of simple S3(3, 4, v)

Kevin T. Phelps, Douglas R. Stinson, Scott A. Vanstone, 1989, Discret. Math..

Elliptic curve cryptosystems and their implementation

Alfred Menezes, Scott A. Vanstone, A. Menezes, 1993, Journal of Cryptology.

New Public-Key Schemes Based on Elliptic Curves over the Ring Zn

Tatsuaki Okamoto, Ueli M. Maurer, Kenji Koyama, 1991, CRYPTO.

The Implementation of Elliptic Curve Cryptosystems

Alfred Menezes, Scott A. Vanstone, A. Menezes, 1990, AUSCRYPT.

Cryptanalysis of the Sakazaki-Okamoto-Mambo ID-based Key Distribution System over Elliptic Curves

Scott A. Vanstone, Minghua Qu, Douglas R Stinson, 2001 .

Graphical codes revisited

Scott A. Vanstone, Dieter Jungnickel, S. Vanstone, 1997, IEEE Trans. Inf. Theory.

Hyperplane skew resolutions and their applications

Scott A. Vanstone, Ryoh Fuji-Hara, S. Vanstone, 1988, J. Comb. Theory, Ser. A.

The existence of orthogonal resolutions of lines in AG(n, q)

Scott A. Vanstone, Ryoh Fuji-Hara, S. Vanstone, 1987, J. Comb. Theory, Ser. A.

Transversal Designs and Doubly-resolvable Designs

Scott A. Vanstone, Ryoh Fuji-Hara, S. Vanstone, 1980, Eur. J. Comb..

Doubly resolvable designs

S. A. VANSTONE, S. Vanstone, 1980, Discret. Math..

On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays

Scott A. Vanstone, Rudolf Mathon, S. Vanstone, 1980, Discret. Math..

Bounds for permutation arrays

Michel Deza, Scott A. Vanstone, S. Vanstone, 1978 .

Coverings of Pairs by Quintuples

Ronald C. Mullin, Scott A. Vanstone, W. H. Mills, 1987, J. Comb. Theory, Ser. A.

Accelerated Verification of ECDSA Signatures

Scott A. Vanstone, Daniel R. L. Brown, Robert P. Gallant, 2005, Selected Areas in Cryptography.

On orders of optimal normal basis generators

Shuhong Gao, Scott A. Vanstone, S. Vanstone, 1994, ANTS.

Some Computational Aspects of Root Finding in GF(qm)

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone, 1988, ISSAC.

Complexity Issues for Public Key Cryptography

Ian F. Blake, Paul C. van Oorschot, Scott A. Vanstone, 1988 .

Elliptic curve cryptosystem - The answer to strong, fast public-key cryptography for securing constrained environments

Scott A. Vanstone, S. Vanstone, 1997, Inf. Secur. Tech. Rep..

Balanced tournament designs and related topics

Scott A. Vanstone, Esther R. Lamken, S. Vanstone, 1989, Discret. Math..

Orthogonal resolutions in odd balanced tournament designs

Scott A. Vanstone, Esther R. Lamken, S. Vanstone, 1988, Graphs Comb..

Designs With Mutually Orthogonal Resolutions

Scott A. Vanstone, Esther R. Lamken, S. Vanstone, 1986, Eur. J. Comb..

A few more balanced Room squares

Douglas R. Stinson, Scott A. Vanstone, Douglas R Stinson, 1985, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

On strong starters in cyclic groups

Douglas R. Stinson, William Kocay, Scott A. Vanstone, 1985, Discret. Math..

The existence of howell designs of siden+1 and order 2n

Douglas R. Stinson, Paul J. Schellenberg, Scott A. Vanstone, 1981, Comb..

Pairwise "Orthogonal Generalized Room Squares" and Equidistant Permutation Arrays

Scott A. Vanstone, S. Vanstone, 1978, J. Comb. Theory, Ser. A.

The existence of partitioned balanced tournament designs of side 4n + 3

Scott A. Vanstone, E. R. Lamken, S. Vanstone, 1987 .

Balanced Room Squares from Finite Geometries and their Generalizations

Scott A. Vanstone, S. Vanstone, R. Fuji-Hara, 1987 .

The Existence of Partitioned Balanced Tournament Designs

Scott A. Vanstone, E. R. Lamken, S. Vanstone, 1987 .

On the Existence of Strong Kirkman Cubes of Order 39 and Block Size 3

Alexander Rosa, Scott A. Vanstone, S. Vanstone, 1985 .

A Kirkman square of order 51 and block size 3

Douglas R. Stinson, Scott A. Vanstone, Douglas R Stinson, 1985, Discret. Math..

On Mutually Orthogonal Resolutions and Near-Resolutions

Scott A. Vanstone, S. Vanstone, 1982 .

Some Results on the Existence of Squares

Douglas R. Stinson, Ronald C. Mullin, Paul J. Schellenberg, 1980 .

Steiner Systems and Room Squares

Ronald C. Mullin, Scott A. Vanstone, S. Vanstone, 1980 .

Validation of Elliptic Curve Public Keys

Alfred Menezes, Scott A. Vanstone, René Struik, 2003, Public Key Cryptography.

Affine Geometries Obtained from Projective Planes and Skew Resolutions on AG(3,q)

Scott A. Vanstone, S. Vanstone, R. Fuji-Hara, 1983 .

Notes on Coding Theory

D. A. Leonard, F. MacWilliams, R. Blahut, 2003 .

An Introduction to Error Correcting Codes with Applications

Paul C. van Oorschot, Scott A. Vanstone, P. V. Oorschot, 1989 .

On resolvable designs S3(3; 4, v)

Scott A. Vanstone, Dieter Jungnickel, S. Vanstone, 1986, J. Comb. Theory, Ser. A.

On the structure of regular pairwise balanced designs

Scott A. Vanstone, David McCarthy, S. Vanstone, 1979, Discret. Math..

Hanani triple systems

Charles J. Colbourn, Douglas R. Stinson, Alexander Rosa, 1993 .

Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2

Scott A. Vanstone, Volker Müller, Robert J. Zuccherato, 1998, Des. Codes Cryptogr..

Elliptic curve cryptosystems using curves of smooth order over the ring Zn

Scott A. Vanstone, Robert J. Zuccherato, R. Zuccherato, 1997, IEEE Trans. Inf. Theory.

Low complexity normal bases

Ian F. Blake, Scott A. Vanstone, David W. Ash, 1989, Discret. Appl. Math..

Computing Logarithms in GF(2n)

Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone, 1985, CRYPTO.

On the existence of frames

Ronald C. Mullin, Paul J. Schellenberg, Scott A. Vanstone, 1981, Discret. Math..

Resolvable (r, λ)-designs and the Fisher inequality

Scott A. Vanstone, S. Vanstone, 1979, Journal of the Australian Mathematical Society.

Existence results for doubly near resolvable (upsilon, 3, 2)-BIBDs

Scott A. Vanstone, Esther R. Lamken, S. Vanstone, 1993, Discret. Math..

Balanced tournament designs and resolvable (upsilon, 3, 2)-bibds

Scott A. Vanstone, Esther R. Lamken, S. Vanstone, 1990, Discret. Math..

Introduction to Algebraic Geometry

S. Vanstone, I. Blake, R. Mullin, 1993 .

Counting Points on Elliptic Curves Over F2m

R. Zuccherato, A. Menezes, S. Vanstone, 1993 .

On Maximal Equidistant Permutation Arrays

Scott A. Vanstone, M. Deza, S. Vanstone, 1982 .