Shor's discrete logarithm quantum algorithm for elliptic curves

Quantum Information and Computation

Volumn 3, Issue 4, 2003, Pages 317-344

  Proos, John ^a   Zalka, Christof ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Discrete logarithm; Elliptic curves; Quantum computation

Indexed keywords

GEOMETRY; QUANTUM COMPUTERS; QUANTUM THEORY;

CRYPTOGRAPHIC KEY; CURRENT COMPUTING; DISCRETE LOGARITHMS; ELLIPTIC CURVE; EUCLID'S ALGORITHM; MULTIPLICATIVE INVERSE; QUANTUM ALGORITHMS; TECHNICAL DIFFICULTIES;

QUBITS;

EID: 0141457783     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. P. Shor, Algorithms for Quantum Computation: Discrete Logarithms and Factoring, Proc. 35th Annual Symposium on Foundations of Computer Science. IEEE Press, pp 124-134, Nov. 1994, quant-ph/9508027
2. J. Pollard, Factoring with cubic integers, in The Development of the Number Field Sieve, Vol. 1554 of Lecture Notes in Math. (1993)
3. J. Pollard, BIT 15 (1975), p.331, also Knuth [22], Vol. 2, p.385
4. J. Pollard, BIT 15 (1975), p.331, also Knuth [22], Vol. 2, p.385
5. S. Beauregard, Circuit for Shor's algorithm using 2n+3 qubits, Quantum Information and Computation, Vol. 3, No. 2 (2003) pp. 175-185, (also quant-ph/0205095)
6. Ch. Zalka, Fast versions of Shor's quantum factoring algorithm, quant-ph/9806084
7. ANSI X9.62, Public key cryptography for the financial services industry - the Elliptic Curve Digital Signature Algorithm (ECDSA), January 1999
8. IEEE P1363, Standard Specifications for Public-Key Cryptography, February 2000
9. US standard FIPS 186-2 (curves are in appendix 6) see e.g. http://csrc.nist.gov/publications/fips/
10. M. Ettinger and P. Hoyer, On Quantum Algorithms for Noncommutative Hidden Subgroups, quant-ph/9807029
11. R. Jozsa, Quantum Algorithms and the Fourier Transform, Proc. R. Soc. Lond. A (1998) 454, pp.323-337, (also quant-ph/9707033)
12. A.Yu. Kitaev, Quantum measurements and the Abelian Stabilizer Problem, quant-ph/9511026
13. S.C. Pohlig and M.E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transactions on Information Theory, 24 (1978), 106-110.
14. S. Hallgren and L. Hales, An Improved Quantum Fourier Transform Algorithm and Applications, FOCS 2000, (also available at http://wvw.cs.caltech.edu/̃hallgren/)
15. M. Mosca and Ch. Zalka, Exact quantum Fourier transforms and discrete logarithm algorithms, quant-ph/0301093
16. J. Chahal, Topics in Number Theory, Plenum Press, New York, 1988
17. N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, New York, 1994.
18. A. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, Boston, 1993.
19. R. Cleve et. al., Quantum Algorithms revisited, Proc. R. Soc. Lond. A (1998) 454, p.339, (also quant-ph/9708016)
20. R.B. Griffiths and C.-S. Niu Semiclassical Fourier Transform for Quantum Computation, Phys.Rev.Lett. 76 (1996) pp.3228-3231 (also quant-ph/9511007)
21. V. Vedral, A. Barenco and A. Ekert, Quantum Networks for Elementary Arithmetic Operations, quant-ph/9511018
22. H. Cohen, A Course in Computational Algebraic Number Theory, Springer-Verlag, Berlin, 1993.
23. D. Knuth, The Art of Computer Programming, Volumes 1-3, Addison-Wesley 1998
24. Eric Bach and Jeffery Shallit, Algorithmic Number Theory, MIT Press, 1996.
25. H. Heilbronn, On the average length of a class of finite continued fraction, in Number Theory and Analysis (Papers in Honor of Edmund Landau), pp. 87-96, Plenum, New York, 1969.
26. T. Draper, Addition on a Quantum Computer, quant-ph/0008033
27. NIST, Revised draft of Key Management Guideline, http://csrc.nist.gov/encryption/kms/
28. http://www.rsasecurity.com/rsalabs/challenges/index.html
29. http://www.certicom.com/research/ecc_challenge.html