Advances in Cryptology - CRYPTO 2003

DOI10.1007/B11817MaRDI QIDQ5428129zbMATH OpenOpenAlexDBLPFDO

Authors Qi Cheng

Publication date 28 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11817

Mathematics Subject Classification ID

Primality (11Y11) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Primality proving via one round in ECPP and one iteration in AKS
• Proving primality in essentially quartic random time
• Elliptic Curves and Primality Proving
• scientific article; zbMATH DE number 2123628
• Four primality testing algorithms

Cited in

(5)

• On the construction of finite field elements of large order
• Primality proving via one round in ECPP and one iteration in AKS
• Proving primality in essentially quartic random time
• Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
• Counting points on curves and Abelian varieties over finite fields

This page was built for publication: Advances in Cryptology - CRYPTO 2003

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