Back to Results
First PageMeta Content
Number theory / Finite fields / Conjectures / Analytic number theory / Elliptic curves / Elliptic curve primality proving / AKS primality test / Quadratic residue / Prime number / Abstract algebra / Mathematics / Primality tests


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 algorithms
Add to Reading List

Document Date: 2005-12-13 09:43:17

Open Document

File Size: 150,93 KB

Share Result on Facebook
UPDATE