A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Distributed primality proving and the primality of (23539+1)/3
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Efficient generation of shared RSA keys
Journal of the ACM (JACM)
How to Choose Secret Parameters for RSA-Type Cryptosystems over Elliptic Curves
Designs, Codes and Cryptography
Coalition Public-Key Cryptosystems
Cybernetics and Systems Analysis
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Matrix Extensions of the RSA Algorithm
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
On Generation of Probable Primes By Incremental Search
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Fast Generation of Provable Primes Using Search in Arithmetic Progressions
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Information Processing Letters
Information Processing Letters
Security analysis of the strong diffie-hellman problem
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
| Hi-index | 0.01 |
A simple method is given for finding strong, random, large primes of a given number of bits, for use in conjunction with the RSA Public Key Cryptosystem. A strong prime p is a prime satisfying: * p = 1 mod r * p = s-1 mod s * r = 1 mod t, where r,s and t are all large, random primes of a given number of bits. It is shown that the problem of finding strong, random, large primes is only 19% harder than finding random, large primes.