On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography

A theory of Galois switching functions

D. K. Pradhan · 1978

Earlier work this paper cites.

Reversible computing

T. Toffoli · 1980

Earlier work this paper cites.

VLSI designs for multiplication over finite fields G ​ F ​ ( 2 m ) GF(2^{m})

E. D. Mastrovito · 1988

Earlier work this paper cites.

VLSI Architectures for Computation in Galois Fields

E. D. Mastrovito · 1991

Earlier work this paper cites.

An implementation of elliptic curve cryptosystems over G ​ F ​ ( 2 155 ) GF(2^{155})

G. B. Agnew, R. C. Mullin, and S. A. Vanstone · 1993

Earlier work this paper cites.

Reducing elliptic curve logarithms to logarithms in a finite field

A. J. Menezes, T. Okamoto, and S. A. Vanstone · 1993

Earlier work this paper cites.

Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

P. W. Shor · 1997

Earlier work this paper cites.

Quantum algorithms and the Fourier transform

R. Jozsa · 1998

Cited alongside, same era.

Modern Computer Algebra

J. Von Zur Gathen and J. Gerhard · 1999

Cited alongside, same era.

Fast parallel circuits for the quantum Fourier transform

R. Cleve and J. Watrous · 2000

Cited alongside, same era.

Software implementation of elliptic curve cryptography over binary fields

D. Hankerson, J. López Hernandez, and A. Menezes · 2000

Cited alongside, same era.

Quantum Computation and Quantum Information

M. Nielsen and I. Chuang · 2000

Cited alongside, same era.

Quantum arithmetic on Galois fields

S. Beauregard, G. Brassard, and J. M. Fernandez · 2003

Cited alongside, same era.

Shor’s discrete logarithm quantum algorithm for elliptic curves

Certicom announces elliptic curve cryptography challenge winner

Certicom · 2004

Later among the works it cites.

Low complexity bit parallel architectures for polynomial basis multiplication over G ​ F ​ ( 2 m ) GF(2^{m})

A. Reyhani-Masoleh and M. A. Hasan · 2004

Later among the works it cites.

Elliptic Curve Cryptography: The next generation of wireless security

S. A. Vanstone · 2004

Later among the works it cites.

Optimized quantum implementation of elliptic curve arithmetic over binary fields

P. Kaye · 2005

Later among the works it cites.

Fast quantum modular exponentiation

R. Van Meter and K. M. Itoh · 2005

Later among the works it cites.

Shor’s algorithm on a nearest-neighbor machine

S. A. Kutin · 2007

Closest in time.