Short RSA keys and their generation

Journal of Cryptology: The Journal of the International Association for Cryptologie Research (IACR)

Volumn 8, Issue 2, 1995, Pages 101-114

  Vanstone, Scott A ^a   Zuccherato, Robert J ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Integer factorization; Prime number generation; Public key cryptography; RSA; Security

Indexed keywords

BANDWIDTH; CODES (SYMBOLS); DATA STORAGE EQUIPMENT; DATA TRANSFER; NUMBER THEORY; SECURITY OF DATA;

INTEGER FACTORIZATION; PRIME NUMBER GENERATION; PUBLIC KEY CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 0029272081     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/BF00190758     Document Type: Article

References (27)

1. 155
2. A practical RSA trapdoor
3. The generation of random numbers that are probably prime
4. On a problem of Oppenheim concerning “Factorisatio Numerorum,”
5. P−1 ≡ 1 (mod P)
6. New directions in cryptography
7. A public key cryptosystem and a signature scheme based on discrete logarithms
8. Public key cryptosystems with very small key size
9. Analysis of a simple factorization algorithm
10. Factoring with elliptic curves
11. Elliptic curve cryptosystems and their implementation
12. Riemann's hypothesis and tests for primality
13. A comparison of practical public key cryptosystems based on integer factorization and discrete logarithms
14. The determination of the prime or composite nature of large numbers by Fermat's theorem
15. Theorems on factorization and primality testing
16. Analysis and comparison of some integer factoring algorithms
17. Probabilistic algorithms for testing primality
18. A method for obtaining digital signatures and public-key cryptosystems