On the provable security of an efficient RSA-based pseudorandom generator

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4284 LNCS, Issue , 2006, Pages 194-209

  Steinfeld, Ron ^a   Pieprzyk, Josef ^a   Wang, Huaxiong ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

Lattice attack; Provable security; Pseudorandom generator; RSA

Indexed keywords

CRYPTOLOGY; INVERSION PROBLEMS; PLAINTEXT; PROVABLE SECURITY; PROVABLY SECURE; PSEUDORANDOM GENERATORS; PSEUDORANDOMNESS; RSA MODULI; SIMPLE MODIFICATIONS;

CRYPTOGRAPHY; HARDNESS; RAIN GAGES;

NETWORK SECURITY;

EID: 56749098583     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935230_13     Document Type: Conference Paper

References (30)

1. W. Alexi, B. Chor, O. Goldreich, and C.P. Schnorr. RSA and Rabin Functions: Certain Parts Are as Hard as the Whole. SIAM Journal on Computing, 17(2):194-209, 1988.
2. M. Ben-Or, B. Chor, and A. Shamir. On the Cryptographic Security of Single RSA Bits. In Proc. 15-th STOC, pages 421-430, New York, 1983. ACM Press.
3. C. Berbain, H. Gilbert, and J. Patarin. QUAD: a Practical Stream Cipher with Provable Security. In EUROCRYPT 2006, volume 4004 of LNCS, pages 109-128, Berlin, 2006. Springer-Verlag.
4. S.R. Blackburn, D. Gomez-Perez, J. Gutierrez, and I.E. Shparlinski. Reconstructing Noisy Polynomial Evaluation in Residue Rings. Journal of Algorithms. (To Appear).
5. S.R. Blackburn, D. Gomez-Perez, J. Gutierrez, and I.E. Shparlinski. Predicting Nonlinear Pseudorandom Number Generators. Mathematics of Computation, 74:1471-1494, 2004.
6. L. Blum, M. Blum, andM. Shub. A Simple Unpredictable Pseudo-Random Number Generator. SIAM Journal on Computing, 15:364-383, 1986.
7. M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM Journal on Computing, 13:850-864, 1984.
8. 0.292. IEEE Trans. on Info. Theory, 46(4):1339-1349, 2000.
9. D. Boneh, S. Halevi, and N.A. Howgrave-Graham. The Modular Inversion Hidden Number Problem. In ASIACRYPT 2001, volume 2248 of LNCS, pages 36-51, Berlin, 2001. Springer-Verlag.
10. D. Catalano, R. Gennaro, N. Howgrave-Graham, and P. Nguyen. Paillier's Cryptosystem Revisited. In Proc. CCS '01, New York, November 2001. ACM.
11. D. Coppersmith. Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. J. of Cryptology, 10:233-260, 1997.
12. D. Coppersmith. Finding Small Solutions to Low Degree Polynomials. In CALC '01, volume 2146 of LNCS, pages 20-31, Berlin, 2001. Springer-Verlag.
13. W. Dai. Crypto++ 5.2.1 Benchmarks, 2006. http://www.eskimo.com/ ~weidai/ benchmarks.html.
14. R. Fischlin and C.P. Schnorr. Stronger Security Proofs for RSA and Rabin Bits. Journal of Cryptology, 13:221-244, 2000.
15. R. Gennaro. An Improved Pseudo-Random Generator Based on the Discrete-Logarithm Problem. Journal of Cryptology, 18:91-110, 2005.
16. O. Goldreich. Foundations of Cryptography, Volume I. Cambridge University Press, Cambridge, 2003.
17. O. Goldreich and V. Rosen. On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators. J. of Cryptology, 16:71-93, 2003.
18. S. Goldwasser and S. Micali. Probabilistic Encryption. J. of Computer and System Sciences, 28(2):270-299, 1984.
19. S. Goldwasser, S. Micali, and P. Tong. Why and How to Establish a Private Code on a Public Network. In Proc. FOCS '82, pages 134-144. IEEE Computer Society Press, 1982.
20. N. Howgrave-Graham. Finding Small Roots of Univariate Polynomials Revisited. In Cryptography and Coding, volume 1355 of LNCS, pages 131-142, Berlin, 1997. Springer-Verlag.
21. R. Impagliazzo and M. Naor. Efficient Cryptographic Schemes Provably as Secure as Subset Sum. Journal of Cryptology, 9:199-216, 1996.
22. A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring Polynomials with Rational Coefficients. Mathematische Annalen, 261:515-534, 1982.
23. A.K. Lenstra and E.R. Verheul. Selecting Cryptographic Key Sizes. J. of Cryptology, 14:255-293, 2001.
24. S. Micali and C.P. Schnorr. Efficient, Perfect Polynomial Random Number Generators. J. of Cryptology, 3:157-172, 1991.
25. P. Q. Nguyen and I. E. Shparlinski. The insecurity of the digital signature algorithm with partially known nonces. J. Cryptology, 15:151-176, 2002.
26. P. Q. Nguyen and J. Stern. The Two Faces of Lattices in Cryptology. In Cryptography and Lattices, volume 2146 of LNCS, pages 146-180, Berlin, 2001. Springer-Verlag.
27. S. Patel and G. Sundaram. An Efficient Discrete Log Pseudo Random Generator. In CRYPTO '98, volume 1462 of LNCS, pages 304-317, Berlin, 1998. Springer-Verlag.
28. A. Sidorenko and B. Schoenmakers. Concrete Security of the Blum-Blum-Shub Pseudorandom Generator. In Cryptography and Coding 2005, volume 3796 of LNCS, pages 355-375, Berlin, 2005. Springer-Verlag.
29. R. Steinfeld, J. Pieprzyk, and H. Wang. On the Provable Security of an Efficient RSA-Based Pseudorandom Generator. Cryptology ePrint Archive, Report 2006/206, 2006. http://eprint.iacr.org/2006/206.
30. U.V. Vazirani and V.V. Vazirani. Efficient and Secure Pseudo-Random Number Generation. In Proc. FOCS '84, pages 458-463. IEEE Computer Society Press, 1982.