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

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

Open Document

File Size: 150,93 KB

Share Result on Facebook

City

Toulouse / Sydney / Paris / /

Company

Cl / AMD / John Wiley & Sons / /

Country

France / United States / Australia / /

Currency

pence / /

IndustryTerm

reciprocity law / elliptic curve primality proving algorithm / tree search / usual chord-and-tangent law / sub-algorithms / factor algorithm / computing / above algorithm / well defined algorithm / class / /

Movie

D. 4 / /

OperatingSystem

L3 / /

Organization

French Department of Defense / Ecole polytechnique / /

Person

R. Schertz / H. Cohen / W. Lenstra / Jr. / H. W. Lenstra / Jr. / D. Bernardi / F. Morain / A. Enge / /

Position

author / editor / /

Technology

above algorithm / improved Cornacchia algorithm / well defined algorithm / expanded algorithm / stripping factor algorithm / basic ECPP algorithm / ECPP algorithm / AKS algorithm / ELLIPTIC CURVE PRIMALITY PROVING ALGORITHM / Cantor-Zassenhaus algorithm / Tonelli-Shanks algorithm / /

URL

http /

SocialTag