Strong Primes are Easy to Find

DOI10.1007/3-540-39757-4_19MaRDI QIDQ3728811zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 697832
• How strong can primes be
• scientific article; zbMATH DE number 16481
• Efficient method for generating strong primes with constraint of bit length
• Optimal strong primes

Cited in

(14)

• Generating strong primes in RSA cryptosystems
• Calculation of random pairs of primes whose product lies in a given short interval
• How strong can primes be
• Optimal strong primes
• Security Analysis of the Strong Diffie-Hellman Problem
• scientific article; zbMATH DE number 597744 (Why is no real title available?)
• On the number of strong primes
• On using primes for public key encryption systems
• Finding large primes
• Algorithmic and Experimental Computation of Higher‐Order Safe Primes
• Application of Parallel Virtual Machine Framework to the Strong Prime Problem
• Finding large primes
• Efficient method for generating strong primes with constraint of bit length
• Discrete logarithm problems with auxiliary inputs

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)