scientific article; zbMATH DE number 177027

zbMATH Open0779.11063MaRDI QIDQ4036863FDOQ4036863

Authors: François Morain 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

algorithmprimality testingelliptic curve methodlarge primes

Mathematics Subject Classification ID

Cryptography (94A60) Primality (11Y11)

Cited In (10)

• 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
• Title not available (Why is that?)
• Prime numbers as a tool to design distributed algorithms
• Title not available (Why is that?)
• Elliptic Curves and Primality Proving
• Title not available (Why is that?)
• 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)