According to our database
1,
Scott A. Vanstone
authored at least 79 papers
between 1977 and 2009.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2009
Security of ECQV-Certified ECDSA Against Passive Adversaries.
IACR Cryptol. ePrint Arch., 2009
2005
Accelerated Verification of ECDSA Signatures.
Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005
2003
An Efficient Protocol for Authenticated Key Agreement.
Des. Codes Cryptogr., 2003
Next generation security for wireless: elliptic curve cryptography.
Comput. Secur., 2003
Validation of Elliptic Curve Public Keys.
Proceedings of the Public Key Cryptography, 2003
2002
Message Authentication Codes with Error Correcting Capabilities.
Proceedings of the Information and Communications Security, 4th International Conference, 2002
2001
The Elliptic Curve Digital Signature Algorithm (ECDSA).
Int. J. Inf. Sec., 2001
Provably Secure Implicit Certificate Schemes.
Proceedings of the Financial Cryptography, 2001
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms.
Proceedings of the Advances in Cryptology, 2001
2000
Improving the parallelized Pollard lambda search on anomalous binary curves.
Math. Comput., 2000
The State of Elliptic Curve Cryptography.
Des. Codes Cryptogr., 2000
Postal Revenue Collection in the Digital Age.
Proceedings of the Financial Cryptography, 2000
1999
1998
Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2.
Des. Codes Cryptogr., 1998
1997
Elliptic curve cryptosystems using curves of smooth order over the ring Z<sub>n</sub>.
IEEE Trans. Inf. Theory, 1997
Graphical codes revisited.
IEEE Trans. Inf. Theory, 1997
Elliptic curve cryptosystem - The answer to strong, fast public-key cryptography for securing constrained environments.
Inf. Secur. Tech. Rep., 1997
1996
Codes Based on Complete Graphs.
Des. Codes Cryptogr., 1996
Handbook of Applied Cryptography
CRC Press, ISBN: 0-8493-8523-7, 1996
1995
Short RSA Keys and Their Generation.
J. Cryptol., 1995
Subspaces and polynomial factorizations over finite fields.
Appl. Algebra Eng. Commun. Comput., 1995
1994
Factorizations in the Elementary Abelian p-Group and Their Cryptographic Significance.
J. Cryptol., 1994
On orders of optimal normal basis generators.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994
1993
Reducing elliptic curve logarithms to logarithms in a finite field.
IEEE Trans. Inf. Theory, 1993
An Implementation of Elliptic Curve Cryptosystems Over F<sub>2<sup>155</sup></sub>.
IEEE J. Sel. Areas Commun., 1993
Elliptic Curve Cryptosystems and Their Implementations.
J. Cryptol., 1993
Arithmetic Operations in GF(2<sup>m</sup>).
J. Cryptol., 1993
Existence results for doubly near resolvable (upsilon, 3, 2)-BIBDs.
Discret. Math., 1993
1992
Pair-Splitting Sets in <i>AG(m, q)</i>.
SIAM J. Discret. Math., 1992
Subgroup Refinement Algorithms for Root Finding in GF(q).
SIAM J. Comput., 1992
On Kirkman triple systems of order 33.
Discret. Math., 1992
A Note on Cycloc Groups, Finite Fields, and the Discrete Logarithm Problem.
Appl. Algebra Eng. Commun. Comput., 1992
Public-Key Cryptosystems with Very Small Key Length.
Proceedings of the Advances in Cryptology, 1992
On the Development of a Fast Elliptic Curve Cryptosystem.
Proceedings of the Advances in Cryptology, 1992
1991
An Implementation for a Fast Public-Key Cryptosystem.
J. Cryptol., 1991
Isomorphism of strong starters in cyclic groups.
J. Comb. Theory A, 1991
Class-uniformly resolvable pairwise balanced designs with block sizes two and three.
Discret. Math., 1991
Triple systems in PG(2, q).
Discret. Math., 1991
The spectrum of alpha-resolvable block designs with block size 3.
Discret. Math., 1991
The existence of non-trivial hyperfactorization of K<sub>2n</sub>.
Comb., 1991
New Public-Key Schemes Based on Elliptic Curves over the Ring Z<sub>n</sub>.
Proceedings of the Advances in Cryptology, 1991
1990
The existence of skew Howell designs of side 2<i>n</i> and order 2<i>n</i> + 2.
J. Comb. Theory A, 1990
On splitting sets in block designs and finding roots of polynomials.
Discret. Math., 1990
Balanced tournament designs and resolvable (upsilon, 3, 2)-bibds.
Discret. Math., 1990
The Implementation of Elliptic Curve Cryptosystems.
Proceedings of the Advances in Cryptology, 1990
1989
A geometric approach to root finding in GF(q<sup>m</sup>).
IEEE Trans. Inf. Theory, 1989
The existence of simple S<sub>3</sub>(3, 4, v).
Discret. Math., 1989
Balanced tournament designs and related topics.
Discret. Math., 1989
Doubly resolvable designs from generalized Bhaskar Rao designs.
Discret. Math., 1989
Optimal normal bases in GF(p<sup>n</sup>).
Discret. Appl. Math., 1989
Low complexity normal bases.
Discret. Appl. Math., 1989
A Fast Elliptic Curve Cryptosystem.
Proceedings of the Advances in Cryptology, 1989
1988
A Combinatorial Approach to Threshold Schemes.
SIAM J. Discret. Math., 1988
On designs (22, 33, 12, 8, 4).
J. Comb. Theory A, 1988
Hyperplane skew resolutions and their applications.
J. Comb. Theory A, 1988
Orthogonal resolutions in odd balanced tournament designs.
Graphs Comb., 1988
Some Computational Aspects of Root Finding in GF(q<sup>m</sup>).
Proceedings of the Symbolic and Algebraic Computation, 1988
Fast Exponentiation in <i>GF(2<sup>n</sup>)</i>.
Proceedings of the Advances in Cryptology, 1988
An Interactive Data Exchange Protocol Based on Discrete Exponentiation.
Proceedings of the Advances in Cryptology, 1988
1987
Coverings of Pairs by Quintuples.
J. Comb. Theory A, 1987
The existence of orthogonal resolutions of lines in <i>AG</i>(<i>n</i>, <i>q</i>).
J. Comb. Theory A, 1987
1986
On resolvable designs <i>S</i><sub>3</sub>(3; 4, <i>v</i>).
J. Comb. Theory A, 1986
Designs With Mutually Orthogonal Resolutions.
Eur. J. Comb., 1986
Existence results for KS<sub>3</sub>(v; 2, 4)s.
Discret. Math., 1986
1985
A Kirkman square of order 51 and block size 3.
Discret. Math., 1985
On strong starters in cyclic groups.
Discret. Math., 1985
1984
Computing Logarithms in GF(2<sup>n</sup>).
Proceedings of the Advances in Cryptology, 1984
1982
Orthogonal resolutions of lines in AG(n, q).
Discret. Math., 1982
1981
On the existence of frames.
Discret. Math., 1981
The existence of Howell designs of side n+1 and order 2n.
Comb., 1981
1980
Transversal Designs and Doubly-resolvable Designs.
Eur. J. Comb., 1980
Doubly resolvable designs.
Discret. Math., 1980
On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays.
Discret. Math., 1980
1979
On the structure of regular pairwise balanced designs.
Discret. Math., 1979
1978
Pairwise "Orthogonal Generalized Room Squares" and Equidistant Permutation Arrays.
J. Comb. Theory A, 1978
1977
A Construction for Equidistant Permutation Arrays of Index One.
J. Comb. Theory A, 1977
Embedding (r, 1)-designs in finite projective planes.
Discret. Math., 1977
