Revision as of 08:05, 21 May 2020 edit Eumat114 (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 8,951 edits →Quantum version (GEECM): clarify Tag: 2017 wikitext editor ← Previous edit		Revision as of 20:54, 18 November 2020 edit undo Ixfd64 (talk \| contribs) Edit filter managers, Administrators 70,389 edits →Quantum version (GEECM): twice the length Next edit →
Line 121: ==Quantum version (GEECM)== [[Daniel J. Bernstein\|Bernstein]], [[Nadia Heninger\|Heninger]], Lou, & 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 ~~size~~length of the primes found compared to standard EECM,~~{{clarify \|date=May 2020 \|post-text=(double in bits or double in value?)}}~~ assuming a quantum computer with sufficiently many qubits and of comparable speed to the classical computer running EECM. ==See also==

Lenstra elliptic-curve factorization: Difference between revisions