An O(m2)-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2m)

Quantum Information and Computation

Volumn 9, Issue 7-8, 2009, Pages 0610-0621

  Maslov, Dmitri ^a,b   Mathew, Jimson ^c   Cheung, Donny ^d   Pradhan, Dhiraj K ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b NATIONAL SCIENCE FOUNDATION   (United States)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

^d UNIVERSITY OF CALGARY   (Canada)

Author keywords

Cryptography; Elliptic Curve Discrete Logarithm Problem; Quantum Algorithms; Quantum Circuits

Indexed keywords

CRYPTOGRAPHY; MULTIPLYING CIRCUITS; POLYNOMIAL APPROXIMATION; QUANTUM THEORY;

BINARY FINITE FIELDS; DISCRETE LOGARITHM PROBLEMS; ELLIPTIC CURVE; ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEMS; LINEAR NEAREST NEIGHBORS; POLYNOMIAL-TIME ALGORITHMS; QUANTUM ALGORITHMS; QUANTUM CIRCUIT;

GEOMETRY;

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

References (23)

1. 155). IEEE Journal on Selected Areas in Communications, 11(5):804-813, 1993.
2. S. Beauregard, G. Brassard, and J. M. Fernandez. Quantum arithmetic on Galois fields. arXiv:quant-ph/0301163, 2003.
3. Certicom. Certicom announces elliptic curve cryptography challenge winner. Certicom press release, 2004.
4. R. Cleve and J. Watrous. Fast parallel circuits for the quantum Fourier transform. IEEE Symposium, on Foundations of Computer Science, 41:526-536, 2000.
5. D. Hankerson, J. López Hernandez, and A. Menezes. Software implementation of elliptic curve cryptography over binary fields. Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems, 2:1-24, 2000.
6. R. Jozsa. Quantum algorithms and the Fourier transform. Proc. R. Soc. Lond. A, 454:323-337, 1998.
7. P. Kaye. Optimized quantum implementation of elliptic curve arithmetic over binary fields. Quantum Information and Computation, 5(6):474-491, 2005.
8. S. A. Kutin, Shor's algorithm, on a nearest-neighbor machine. Asian conference on Quantum Information Science, pp. 12-13, September 2007, arXiv:quant-ph/0609001.
9. S. A. Kutin, D. P. Moulton, and L. M. Smithline. Computation at a distance. Chicago Journal of Theoretical Computer Science, 2007, arXiv:quant-ph/0701194.
10. m). Proceedings of the Sixth Symposium on Applied Algebra, Algebraic Algorithms, and Error Correcting Codes, 6:297-309, 1988.
11. E. D. Mastrovito, VLSI Architectures for Computation in Galois Fields. PhD Thesis, Linkoping University, Linkoping, Sweden, 1991.
12. A. J. Menezes, T. Okamoto, and S. A. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory, 39:1639-1646, 1993.
13. R. Van Meter and K. M. Itoh. Fast quantum modular exponentiation. Physical Review A, 71:052320, 2005.
14. M. Nielsen and I. Chuang, Quantum, Computation and Quantum, Information. Cambridge University Press, 2000.
15. NSA Suite B Factsheet. http://www.nsa.gov/ia/industry/crypto-suite-b.cfm.
16. D. K. Pradhan. A theory of Galois switching functions. IEEE Transactions on Computers, 27:239-248, 1978.
17. J. Proos and C. Zalka. Shor's discrete logarithm quantum algorithm for elliptic curves. Quantum Information and Computation, 3:317-344, 2003.
18. m). IEEE Transactions on Computers, 53:945-959, 2004.
19. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing, 26:1484-1509, 1997.
20. T. Toffoli. Reversible computing. Tech memo MIT/LCS/TM-151, MIT Lab for Computer Science, 1980.
21. S. A. Vanstone. Elliptic Curve Cryptography: The next generation of wireless security. Markt and Technik, 17:20-23, April 23, 2004.
22. J. Von Zur Gathen and J. Gerhard, Modern Computer Algebra. Cambridge University Press, 1999.
23. 2 - 1.