Tuesday, 18 June, 2013
search
Elliptic Curve Primality Proving Algorithm (Popularity: ) (Score: 11.82) http://www.utm.edu/research/primes/glossary/ECPP.html The ECPP is a modern method of primality proving that does not require auxiliary factorizations. Instead, ECPP uses the sizes of groups of rational points on elliptic curves modulo n. Category: Science\Math\Number Theory\Prime Numbers
ECPP (Popularity: ) (Score: 8.80) http://www.lix.polytechnique.fr/~morain/Prgms/ecpp.english.html The Elliptic Curve Primality Proving program by François Morain. Category: Science\Math\Number Theory\Prime Numbers
Ellipsa (Popularity: ) (Score: 8.80) http://www.ellipsa.net/ Includes Primo, an implementation of ECPP, and CPG, class polynomial builder. Category: Science\Math\Number Theory\Elliptic Curves and Modular Forms
Primo (Popularity: ) (Score: 8.71) http://www.ellipsa.net/ Elliptic Curve Primality Proving (ECPP) implementation. Freeware by Marcel Martin. Category: Science\Math\Number Theory\Prime Numbers
Morain, Francois (Popularity: ) (Score: 8.62) http://www.lix.polytechnique.fr/Labo/Francois.Morain/english-index.html École Polytechnique. Computational number theory, cryptography. Papers, ECPP software. Category: Science\Math\Number Theory\People
© 2005-2010 Science Central. All Rights Reserved