On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5106 LNCS, Issue , 2008, Pages 96-104

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

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CURVE FITTING; GEOMETRY; MULTIPLYING CIRCUITS; POLYNOMIAL APPROXIMATION; PUBLIC KEY CRYPTOGRAPHY; QUANTUM COMPUTERS; QUANTUM CRYPTOGRAPHY;

BINARY FINITE FIELDS; DESIGN AND OPTIMIZATION; DISCRETE LOGARITHM PROBLEMS; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOGRAPHY; POLYNOMIAL-TIME ALGORITHMS; POLYNOMIAL-TIME ATTACKS;

QUANTUM COMMUNICATION;

EID: 58049105960     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89304-2_9     Document Type: Conference Paper

References (20)

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