Strong Primes are Easy to Find

DOI10.1007/3-540-39757-4_19zbMATH Open0596.94016OpenAlexW1514901799WikidataQ56114289 ScholiaQ56114289MaRDI QIDQ3728811FDOQ3728811

John Gordon

Publication date: 1985

Published in: Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-39757-4_19

zbMATH Keywords

strong primeRSA public key cryptosystemlarge primes of a given number of bitsrandom primes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cited In (6)

• Optimal strong primes
• Security Analysis of the Strong Diffie-Hellman Problem
• Title not available (Why is that?)
• On the number of strong primes
• Discrete logarithm problems with auxiliary inputs
• How strong can primes be

This page was built for publication: Strong Primes are Easy to Find

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