Strong Primes are Easy to Find

DOI10.1007/3-540-39757-4_19zbMath0596.94016OpenAlexW1514901799WikidataQ56114289 ScholiaQ56114289MaRDI QIDQ3728811

John Gordon

Publication date: 1985

Published in: Advances in Cryptology (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)

Related Items (5)

Optimal strong primes ⋮ On the number of strong primes ⋮ Security Analysis of the Strong Diffie-Hellman Problem ⋮ Discrete logarithm problems with auxiliary inputs ⋮ Unnamed Item

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