Strong primes are easy to find
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
The little book of big primes
Counting the integers factorable via cyclotomic methods
Journal of Algorithms
Maximally equidistributed combined Tausworthe generators
Mathematics of Computation
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Coding the Lehmer pseudo-random number generator
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
On the distribution of the power generation
Mathematics of Computation
Period of the power generator and small values of Carmichael's function
Mathematics of Computation
Fast Generation of Provable Primes Using Search in Arithmetic Progressions
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
| Hi-index | 0.89 |
We clarify the notion of a strong prime by supplying a precise definition and a characterization for an optimal strong prime. We present a conjecture regarding the distribution and density of optimal strong primes, allowing one to predict in advance the time needed to compute one optimal strong prime of a given bit length. Based on these results, we develop an algorithm to compute optimal strong primes. Some experimental results are also included.