Quantum Cryptoanalysis of Elliptic Curve Systems
Juan Manuel García‐Chamizo, Rolando Menchaca
THE SECURITY OF ELLIPTIC CURVE CRYPTOSYSTEMS IS BASED IN THE INTRACTABILITY OF THE ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM. THE BEST CLASSICAL ALGORITHM KNOWN UNTIL DQTE TO SOLVE THIS PROBLEM IS FULLY EXPONENTIAL IN TIME. THIS IS THE REASON WHY THE ELLIPTIC CURVE PUBLIC KEY CRYPTOGRAPHY IS CONSIDERED THE MOST SECURE KNOWN UNTIL DATE. WE PRESENT IN THIS PAPER AN ALGORITHM THAT RUNNING ON A QUANTUM COMPUTER, CAN SOLVE IN POLYNOMIAL TIME THE ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM. THEN, IF A FUNCTIONAL QUANTUM COMPUTER ISEVER BUILD, ALL THE ELLIPTIC CURVE CRYPTOSYSTEMS WOULD BECOME INSECURE.
Computación y Sistemas•Dec 31, 2001•0 citations