<--- Back to Details
First PageDocument Content
Abstract 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
Date: 2010-03-03 00:16:01
Abstract 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 List

Source URL: maths-people.anu.edu.au

Download Document from Source Website

File Size: 136,56 KB

Share Document on Facebook

Similar Documents

ATKIN’S ECPP (Elliptic Curve Primality Proving) ALGORITHM OSMANBEY UZUNKOL OCTOBER 2004

DocID: 1tRju - View Document

Easy numbers for the Elliptic Curve Primality Proving Algorithm F. Morain yz

DocID: 1stoW - View Document

Elliptic curve / Group theory / Prime number / Finite fields / Primality tests / Elliptic curve primality proving / Abstract algebra / Mathematics / Analytic number theory

Advances in the CM method for elliptic curves F. Morain Laboratoire d’Informatique de l’École polytechnique logoX

DocID: 9T5E - View Document

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

DocID: 9S2B - View Document

Elliptic curve / Group theory / Prime number / Finite fields / Primality tests / Elliptic curve primality proving / Abstract algebra / Mathematics / Analytic number theory

Advances in the CM method for elliptic curves F. Morain

DocID: 5ZVH - View Document