Revision as of 03:39, 26 October 2023 edit Bubba73 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 94,425 edits m →Algorithm ← Previous edit		Revision as of 05:56, 22 March 2024 edit undo A Shortfall Of Gravitas (talk \| contribs) Extended confirmed users 1,119 edits Remove UBASIC link, hand-written x86 FPU assembly doesn't have much place when you can buy one of a few GPUs that are capable of 7-12TFLOP FP64 on ebay for $500-$1000 since they're considered junk by industry now. The fastest Epyc processors still struggle to reach 1/4 of that and that's measured on the vectorized 64-bit float instructions, usually, since the metric is FMA and x87 FPU still needs to be issued two instructions (one of which is an insane latency multiply) to do that Next edit →
Line 125: ==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==~~ [[UBASIC]] for practical program (ECMX). ==References== Line 173 ⟶ 170: [http://ecm.gforge.inria.fr/ GMP-ECM] {{Webarchive\|url=https://web.archive.org/web/20090912000929/http://ecm.gforge.inria.fr/ \|date=2009-09-12 }}, an efficient implementation of ECM. * [http://www.loria.fr/~zimmerma/records/ecmnet.html ECMNet], an easy client-server implementation that works with several factorization projects. * [http://www.sourceforge.net/projects/pyecm pyecm], a python implementation of ECM. ~~Much faster with psyco and/or gmpy.~~ * [http://www.rechenkraft.net/yoyo/ Distributed computing project yoyo@Home] Subproject ECM is a program for Elliptic Curve Factorization which is used ~~by a couple of projects~~ to find factors for different ~~kind~~kinds of numbers. * [https://web.archive.org/web/20130811025532/http://ardoino.com/2008/03/large-integers-factorization/ Lenstra Elliptic Curve Factorization algorithm source code] Simple C and GMP Elliptic Curve Factorization Algorithm source code. * [https://eecm.cr.yp.to/mpfq.html EECM-MPFQ] An implementation of ECM using Edwards curves written with the MPFQ finite field library.

Lenstra elliptic-curve factorization: Difference between revisions