Generating safe primes

DOI10.1515/JMC-2013-5011MaRDI QIDQ2873165zbMATH OpenOpenAlexFDO

Authors Joachim von zur Gathen, Igor E. Shparlinski

Publication date 23 January 2014

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/jmc-2013-5011

zbMATH Keywords

Hofheinz-Kiltz-Shoup cryptosystemsafe primeSophie Germain prime

Mathematics Subject Classification ID

Distribution of primes (11N05) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 810480
• Higher-order safe primes
• Public Key Cryptography - PKC 2005
• Algorithmic and Experimental Computation of Higher‐Order Safe Primes
• scientific article; zbMATH DE number 1759305
• Generating strong primes in RSA cryptosystems
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• scientific article; zbMATH DE number 697832

Cited in

(9)

• Connectedness of digraphs from quadratic polynomials
• Non-malleable time-lock puzzles and applications
• Algorithmic and Experimental Computation of Higher‐Order Safe Primes
• scientific article; zbMATH DE number 810480 (Why is no real title available?)
• Higher-order safe primes
• Simple verifiable delay functions
• On equations (-1)^ p^x+ (-1)^ (2ᵏ(2p + 1))^y= z^2 with Sophie Germain prime p
• Trapdoor memory-hard functions
• On integer sequences in cryptography

This page was built for publication: Generating safe primes

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