A primality test algorithm using supersingular elliptic curves

DOI10.3969/J.ISSN.0253-2778.2010.06.005MaRDI QIDQ3017081zbMATH OpenFDO

Authors

Publication date 19 July 2011

Full work available at URL https://doi.org/10.3969/J.ISSN.0253-2778.2010.06.005

zbMATH Keywords

elliptic curveprimality testSchoof's algorithm

Mathematics Subject Classification ID

Primality (11Y11)

Recommendations

• Elliptic Curves and Primality Proving
• scientific article; zbMATH DE number 2123628
• Primality testing using elliptic curves
• Some remarks on primality proving and elliptic curves
• Primality testing and Abelian varieties over finite fields

Cited in

(5)

• On division polynomial PIT and supersingularity
• Primality testing using elliptic curves
• Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
• Improved primality proving with Eisenstein pseudocubes
• Improved supersingularity testing of elliptic curves

This page was built for publication: A primality test algorithm using supersingular elliptic curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3017081)