Prime generation with the Demytko-Miller-Trbovich algorithm

DOI10.1007/3-540-57220-1_79MaRDI QIDQ4341709zbMATH OpenFDO

Authors Leisa Condie

Publication date 18 June 1997

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

Full work available at URL https://doi.org/10.1007/3-540-57220-1_79

zbMATH Keywords

Demytko-Miller-Trbovich algorithmprime generationpublic-key cryptosystems

Mathematics Subject Classification ID

Primality (11Y11) Cryptography (94A60)

Recommendations

• Fast generation of prime numbers and secure public-key cryptographic parameters.
• scientific article; zbMATH DE number 697832
• scientific article; zbMATH DE number 1759305
• scientific article; zbMATH DE number 16481

Cited in

(7)

• Prime numbers as a tool to design distributed algorithms
• Prime Number Generation Based On Pocklington's Theorem
• Prime number generators
• Fast Generation of Prime Numbers on Portable Devices: An Update
• Some negative results concerning prime number generators
• scientific article; zbMATH DE number 1759305 (Why is no real title available?)
• Fast generation of provable primes using search in arithmetic progressions

This page was built for publication: Prime generation with the Demytko-Miller-Trbovich algorithm

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