Lenstra elliptic-curve factorization: Difference between revisions

Revision as of 22:38, 28 January 2023

Revision as of 04:55, 22 September 2023

Line 124:

==Quantum version (GEECM)==

[[Daniel J. Bernstein|Bernstein]], [[Nadia Heninger|Heninger]], Lou, &and Valenta suggest GEECM, a quantum version of ECM with Edwards curves.<ref>Bernstein D.J., Heninger N., Lou P., Valenta L. (2017) [https://eprint.iacr.org/2017/351 Post-quantum RSA]. In: Lange T., Takagi T. (eds), ''Post-Quantum Cryptography''. PQCrypto 2017. Lecture Notes in Computer Science, vol 10346. Springer, Cham</ref> It uses [[Grover's algorithm]] to roughly double the length of the primes found compared to standard EECM, assuming a quantum computer with sufficiently many qubits and of comparable speed to the classical computer running EECM.

==See also==