scientific article; zbMATH DE number 177027

MaRDI QIDQ4036863zbMATH OpenFDO

Authors François Morain

Publication date 18 May 1993

zbMATH Keywords

algorithmprimality testingelliptic curve methodlarge primes

Mathematics Subject Classification ID

Cryptography (94A60) Primality (11Y11)

Recommendations

• scientific article; zbMATH DE number 65932
• Deterministic elliptic curve primality proving for a special sequence of numbers
• Elliptic Curves and Primality Proving
• Some remarks on primality proving and elliptic curves
• Algorithmic Number Theory

Cited in

(12)

• Primality testing using elliptic curves
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• Recent developments in primality proving
• Kronecker's and Newton's approaches to solving: a first comparison
• Certifying giant nonprimes
• scientific article; zbMATH DE number 3970821 (Why is no real title available?)
• Prime numbers as a tool to design distributed algorithms
• Large primes in generalized Pascal triangles
• Elliptic Curves and Primality Proving
• scientific article; zbMATH DE number 65932 (Why is no real title available?)
• scientific article; zbMATH DE number 2115073 (Why is no real title available?)
• Algorithmic Number Theory

This page was built for publication:

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