The modular inversion hidden number problem

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

Volumn 2248, Issue , 2001, Pages 36-51

  Boneh, Dan ^a   Halevi, Shai ^b   Howgrave Graham, Nick ^b  

^a Stanford University   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximations; Coppersmith s attack; Hidden number problems; Lattices; MAC; Modular inversion; PRNG

Indexed keywords

CRYPTOGRAPHY; CRYSTAL LATTICES; SECURITY OF DATA;

APPROXIMATIONS; HIDDEN NUMBER PROBLEMS; MODULAR INVERSE; MODULAR INVERSION; MOST SIGNIFICANT BIT; PRNG;

INVERSE PROBLEMS;

EID: 84946840551     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45682-1_3     Document Type: Conference Paper

References (16)

1. E. Bach, J. Shallit, “Algorithmic number theory, Volume I: efficient algorithms”, MIT press, 1996.
2. L. Blum, M. Blum, M. Shub, “A simple unpredictable pseudo-random number generator”, SIAM J. Comput. 15, 2 (1986) 364–383.
3. M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J.Computing, 13(4):850–864, November 1984.
4. D. Boneh, Venkatesan R., “Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes”, Proc. of Crypto, 1996, pp. 129–142, 1996.
5. D. Boneh, I. Shparlinksi, “On the unpredictability of bits of the elliptic curve Diffie–Hellman scheme”, In Advances in Cryptology –CR YPTO 2001, volume 2139 of Lecture Notes in Computer Science, pp. 201–212. Springer-Verlag, 2001.
6. D. Coppersmith, “Small solutions to polynomial equations, and low exponent RSA vulnerabilities”, J. of Cryptology, Vol. 10, pp. 233–260, 1997.
7. R. Cramer and V. Shoup, “A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack”, in proc. Crypto’98, pp. 13–25, 1998.
8. R. Cramer and V. Shoup, “Signature schemes based on the Strong RSA Assumption”, Proc. 6th ACM Conf. on Computer and Communications Security, 1999.
9. R. Gennaro. An improved pseudo-random generator based on discrete log. In Advances in Cryptology –CR YPTO 2000, volume 1880 of Lecture Notes in Computer Science, pp. 469–481. Springer-Verlag, 2000.
10. R. Gennaro, S. Halevi, T. Rabin, “Secure hash-and-sign signature without random oracles”, Proc. Eurocrypt’99, pp. 123–139, 1999.
11. R. Impagliazzo, D. Zuckerman, “How to Recycle Random Bits”, FOCS, 1989.
12. N. Howgrave-Graham. Finding small roots of univariate modular equations revisited. In proceedings Cryptography and Coding, Lecture Notes in Computer Science, vol. 1355, Springer-Verlag, pp. 131–142, 1997.
13. N. Howgrave-Graham, N. Smart. Lattice attacks on digital signature schemes. manuscript.
14. A. Lenstra, H. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, vol. 261, pp. 515–534, 1982.
15. M. Naor, O. Reingold, “Number theoretic constructions of efficient pseudo random functions”, Proc. FOCS’97. pp. 458–467.
16. A. Ta-Shma, D. Zuckerman, and S. Safra, “Extractors from Reed-Muller Codes”, FOCS, 2001.