Scott A. Vanstone

IACR Cryptol. ePrint Arch., 2009

2005

Accelerated Verification of ECDSA Signatures.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005

2003

An Efficient Protocol for Authenticated Key Agreement.

[BibT_eX]

Des. Codes Cryptogr., 2003

Next generation security for wireless: elliptic curve cryptography.

[BibT_eX]

[DOI]

Comput. Secur., 2003

Validation of Elliptic Curve Public Keys.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2003

2002

Message Authentication Codes with Error Correcting Capabilities.

[BibT_eX]

[DOI]

Charles C. Y. Lam

Guang Gong

Proceedings of the Information and Communications Security, 4th International Conference, 2002

2001

The Elliptic Curve Digital Signature Algorithm (ECDSA).

[BibT_eX]

[DOI]

Don Johnson

Int. J. Inf. Sec., 2001

Provably Secure Implicit Certificate Schemes.

[BibT_eX]

[DOI]

Daniel R. L. Brown

Robert P. Gallant

Proceedings of the Financial Cryptography, 2001

Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms.

[BibT_eX]

[DOI]

Robert P. Gallant

Robert J. Lambert

Proceedings of the Advances in Cryptology, 2001

2000

Improving the parallelized Pollard lambda search on anomalous binary curves.

[BibT_eX]

[DOI]

Robert P. Gallant

Robert J. Lambert

Math. Comput., 2000

The State of Elliptic Curve Cryptography.

[BibT_eX]

[DOI]

Neal Koblitz

Des. Codes Cryptogr., 2000

Postal Revenue Collection in the Digital Age.

[BibT_eX]

[DOI]

Leon A. Pintsov

Proceedings of the Financial Cryptography, 2000

1999

q-ary graphical codes.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2.

[BibT_eX]

[DOI]

Volker Müller

Robert J. Zuccherato

Des. Codes Cryptogr., 1998

1997

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

[BibT_eX]

[DOI]

Robert J. Zuccherato

IEEE Trans. Inf. Theory, 1997

Graphical codes revisited.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

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

[BibT_eX]

[DOI]

Inf. Secur. Tech. Rep., 1997

1996

Codes Based on Complete Graphs.

[BibT_eX]

[DOI]

Marialuisa J. de Resmini

Des. Codes Cryptogr., 1996

Handbook of Applied Cryptography

[BibT_eX]

[DOI]

CRC Press, ISBN: 0-8493-8523-7, 1996

1995

Short RSA Keys and Their Generation.

[BibT_eX]

[DOI]

Robert J. Zuccherato

J. Cryptol., 1995

Subspaces and polynomial factorizations over finite fields.

[BibT_eX]

[DOI]

Therese C. Y. Lee

Appl. Algebra Eng. Commun. Comput., 1995

1994

Factorizations in the Elementary Abelian p-Group and Their Cryptographic Significance.

[BibT_eX]

[DOI]

Minghua Qu

J. Cryptol., 1994

On orders of optimal normal basis generators.

[BibT_eX]

[DOI]

Shuhong Gao

Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993

Reducing elliptic curve logarithms to logarithms in a finite field.

[BibT_eX]

[DOI]

Tatsuaki Okamoto

IEEE Trans. Inf. Theory, 1993

An Implementation of Elliptic Curve Cryptosystems Over F2155.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 1993

Elliptic Curve Cryptosystems and Their Implementations.

[BibT_eX]

[DOI]

J. Cryptol., 1993

Arithmetic Operations in GF(2m).

[BibT_eX]

[DOI]

J. Cryptol., 1993

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

[BibT_eX]

[DOI]

Discret. Math., 1993

1992

Pair-Splitting Sets in AG(m, q).

[BibT_eX]

[DOI]

Albrecht Beutelspacher

SIAM J. Discret. Math., 1992

Subgroup Refinement Algorithms for Root Finding in GF(q).

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

On Kirkman triple systems of order 33.

[BibT_eX]

[DOI]

Vladimir D. Tonchev

Discret. Math., 1992

A Note on Cycloc Groups, Finite Fields, and the Discrete Logarithm Problem.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1992

Public-Key Cryptosystems with Very Small Key Length.

[BibT_eX]

[DOI]

Greg Harper

Proceedings of the Advances in Cryptology, 1992

On the Development of a Fast Elliptic Curve Cryptosystem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

1991

An Implementation for a Fast Public-Key Cryptosystem.

[BibT_eX]

[DOI]

J. Cryptol., 1991

Isomorphism of strong starters in cyclic groups.

[BibT_eX]

[DOI]

Kevin T. Phelps

J. Comb. Theory, Ser. A, 1991

Ralph Gordon Stanton.

[BibT_eX]

Brendan D. McKay

Jennifer Seberry

Discret. Math., 1991

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

[BibT_eX]

[DOI]

Rolf S. Rees

Discret. Math., 1991

Triple systems in PG(2, q).

[BibT_eX]

[DOI]

Discret. Math., 1991

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

[BibT_eX]

[DOI]

Discret. Math., 1991

The existence of non-trivial hyperfactorization of K2n.

[BibT_eX]

[DOI]

Endre Boros

Comb., 1991

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1991

1990

The existence of skew Howell designs of side 2n and order 2n + 2.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1990

On splitting sets in block designs and finding roots of polynomials.

[BibT_eX]

[DOI]

Discret. Math., 1990

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

[BibT_eX]

[DOI]

Discret. Math., 1990

The Implementation of Elliptic Curve Cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1990

1989

A geometric approach to root finding in GF(qm).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

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

[BibT_eX]

[DOI]

Kevin T. Phelps

Discret. Math., 1989

Balanced tournament designs and related topics.

[BibT_eX]

[DOI]

Discret. Math., 1989

Doubly resolvable designs from generalized Bhaskar Rao designs.

[BibT_eX]

[DOI]

D. J. Curran

Discret. Math., 1989

Optimal normal bases in GF(pn).

[BibT_eX]

[DOI]

Discret. Appl. Math., 1989

Low complexity normal bases.

[BibT_eX]

[DOI]

David W. Ash

Ian F. Blake

Discret. Appl. Math., 1989

A Fast Elliptic Curve Cryptosystem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1989

1988

A Combinatorial Approach to Threshold Schemes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

On designs (22, 33, 12, 8, 4).

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1988

Hyperplane skew resolutions and their applications.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1988

Orthogonal resolutions in odd balanced tournament designs.

[BibT_eX]

[DOI]

Graphs Comb., 1988

Some Computational Aspects of Root Finding in GF(qm).

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 1988

Fast Exponentiation in GF(2n).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1988

An Interactive Data Exchange Protocol Based on Discrete Exponentiation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1988

1987

Coverings of Pairs by Quintuples.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1987

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

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1987

1986

On resolvable designs S3(3; 4, v).

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1986

Designs With Mutually Orthogonal Resolutions.

[BibT_eX]

[DOI]

Eur. J. Comb., 1986

Existence results for KS3(v; 2, 4)s.

[BibT_eX]

[DOI]

Discret. Math., 1986

1985

A Kirkman square of order 51 and block size 3.

[BibT_eX]

[DOI]

Discret. Math., 1985

On strong starters in cyclic groups.

[BibT_eX]

[DOI]

William L. Kocay

Discret. Math., 1985

1984

Computing Logarithms in GF(2n).

[BibT_eX]

[DOI]

Ian F. Blake

Proceedings of the Advances in Cryptology, 1984

1982

Orthogonal resolutions of lines in AG(n, q).

[BibT_eX]

[DOI]

Discret. Math., 1982

1981

On the existence of frames.

[BibT_eX]

[DOI]

Discret. Math., 1981

The existence of Howell designs of side n+1 and order 2n.

[BibT_eX]

[DOI]

Comb., 1981

1980

Transversal Designs and Doubly-resolvable Designs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1980

Doubly resolvable designs.

[BibT_eX]

[DOI]

Discret. Math., 1980

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

[BibT_eX]

[DOI]

Rudolf Mathon

Discret. Math., 1980

1979

On the structure of regular pairwise balanced designs.

[BibT_eX]

[DOI]

David McCarthy

Discret. Math., 1979

1978

Pairwise "Orthogonal Generalized Room Squares" and Equidistant Permutation Arrays.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1978

Extremal (r, λ)-designs.

[BibT_eX]

[DOI]

Discret. Math., 1978

1977

A Construction for Equidistant Permutation Arrays of Index One.

[BibT_eX]

[DOI]

Paul J. Schellenberg

J. Comb. Theory, Ser. A, 1977

Embedding (r, 1)-designs in finite projective planes.

[BibT_eX]

[DOI]

David McCarthy