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

This publication has 14 references indexed in Scilit:

• Linear depth stabilizer and quantum Fourier transformation circuits with no auxiliary qubits in finite-neighbor quantum architectures
  Physical Review A, 2007
• Fast quantum modular exponentiation
  Physical Review A, 2005
• Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)
  IEEE Transactions on Computers, 2004
• Fast parallel circuits for the quantum Fourier transform
  2002
• Software Implementation of Elliptic Curve Cryptography over Binary Fields
  2000
• Quantum algorithms and the Fourier transform
  Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  SIAM Journal on Computing, 1997
• Reducing elliptic curve logarithms to logarithms in a finite field
  IEEE Transactions on Information Theory, 1993
• An implementation of elliptic curve cryptosystems over F/sub 2/155
  IEEE Journal on Selected Areas in Communications, 1993
• Vlsi designs for multiplication over finite fields GF(2m)
  1989