Strong Primes are Easy to Find
From MaRDI portal
Publication:3728811
Recommendations
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)