Analysis of Iterated Modular Exponentiation: The Orbits of cursive Greek chiα mod N

Designs, Codes, and Cryptography

Volumn 13, Issue 3, 1998, Pages 229-245

  Brennan, J J ^a   Geist, Bruce ^b  

^a Electronic Data Systems   (United States)

^b Unisys   (United States)

Author keywords

Blum; Blum and Shub pseudo random generator; Iterated encryption; RSA

Indexed keywords

EID: 0041182876     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008289605486     Document Type: Article

References (9)

1. Werner Alexi, Benny Chor, Oded Goldreich, and Claus P. Schnorr, RSA and Rabin functions: certain parts are as hard as the whole, Siam Journal of Computing, Vol. 17, No. 2 (1988) pp. 194-209.
2. Derek Atkins, Michael Graff, Arjen K. Lenstra, and Paul C. Leyland, The magic words are squeamish ossifrage, Advances in Cryptology - Asiacrypt'94, pp. 263-277 (1994).
3. L. Blum, M. Blum, and M. Shub, A simple unpredictable pseudo-random number generator, Siam Journal of Computing, Vol. 15, No. 2 (1986) pp. 364-381.
4. David M. Burton, Elementary Number Theory, Wm. C. Brown Publishers, Dubuque, Iowa (1994).
5. Benny Chor, Oded Goldreich, and Shafi Goldwasser, The bit security of modular squaring given partial factorization of the modulus, Advances in Cryptology: Proceedings of Crypto 85 (1986) pp. 448-457.
6. Donald E. Knuth. The Art of Computer Programming: Seminumerical Algorithms, volume 2, Addison-Wesley, Reading, MA (1981).
7. Ueli M. Maurer, Fast generation of prime numbers and secure public-key cryptographic parameters, Journal of Cryptology, Vol. 8 (1995) pp. 123-155.
8. H. C. Pocklington, The determination of the prime or composite nature of large numbers by Fermat's Theorem, Proceedings of the Cambridge Philosophical Society 18 (1914-1916) pp. 29-30.
9. Umesh V. Vazirani and Vijay V. Vazirani, Efficient and secure pseudo-random number generation, Proc. 25th IEEE Symposium on Foundations of Computer Science (1984) pp. 458-463.