First Page | Document Content | |
---|---|---|
Date: 2010-03-03 00:16:01Abstract algebra Miller–Rabin primality test AKS primality test Primality certificate Elliptic curve primality proving Randomized algorithm Prime number Fermat primality test Time complexity Primality tests Mathematics Theoretical computer science | Add to Reading ListSource URL: maths-people.anu.edu.auDownload Document from Source WebsiteFile Size: 136,56 KBShare Document on Facebook |
ATKIN’S ECPP (Elliptic Curve Primality Proving) ALGORITHM OSMANBEY UZUNKOL OCTOBER 2004DocID: 1tRju - View Document | |
Easy numbers for the Elliptic Curve Primality Proving Algorithm F. Morain yzDocID: 1stoW - View Document | |
Advances in the CM method for elliptic curves F. Morain Laboratoire d’Informatique de l’École polytechnique logoXDocID: 9T5E - View Document | |
IMPLEMENTING THE ASYMPTOTICALLY FAST VERSION OF THE ELLIPTIC CURVE PRIMALITY PROVING ALGORITHM F. MORAIN Abstract. The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithmsDocID: 9S2B - View Document | |
Advances in the CM method for elliptic curves F. MorainDocID: 5ZVH - View Document |