Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation

Mathematics of Computation

Volumn 72, Issue 243, 2003, Pages 1473-1485

  Howgrave Graham, Nick A ^a   Nguyen, Phong Q ^b   Shparlinski, Igor E ^c  

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

^b Departement d'Informatique   (France)

^c MACQUARIE UNIVERSITY   (Australia)

Author keywords

Exponential sums; Hidden number problem; Lattice reduction; Noisy exponentiation; Timed release crypto

Indexed keywords

EID: 0038129638     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-03-01495-9     Document Type: Article

References (30)

1. M. Ajtai, R. Kumar and D. Sivakumar, A sieve algorithm for the shortest lattice vector problem, Proc. 33rd ACM Symp. on Theory of Comput., Crete, Greece, July 6-8, 2001, 601-610.
2. L. Babai, On Lovász lattice reduction and the nearest lattice point problem, Combinatorica, 6 (1986), 1-13. MR 88a:68049
3. R. C. Baker and G. Harman, Shifted primes without large prime factors, Acta Arithm., 83 (1998), 331-361. MR 99b:11104
4. D. Boneh and R. Venkatesan, Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1109 (1996), 129-142.
5. D. Boneh and R. Venkatesan, Rounding in lattices and its cryptographic applications, Proc. 8th Annual ACM-SIAM Symp. on Discr. Algorithms, ACM, NY, 1997, 675-681.
6. E. El Mahassni, P. Q. Nguyen and I. E. Shparlinski, The insecurity of some DSA-like signature schemes with partially known nonces, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2146 (2001), 97-109.
7. A. M. Frieze, J. Håstad, R. Kannan, J. C. Lagarias, and A. Shamir, Reconstructing truncated integer variables satisfying linear congruence, SIAM J. Comp., 17 (1988), 262-280. MR 89d:11115
8. M. I. González Vasco and I. E. Shparlinski, On the security of Diffie-Hellman bits, Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999, Birkhäuser, 2001, 257-268.
9. M. I. González Vasco and I. E. Shparlinski, Security of the most significant bits of the Shamir message passing scheme, Math. Comp., 71 (2002), 333-342. MR 2002j:11153
10. N. A. Howgrave-Graham and N. P. Smart, Lattice attacks on digital signature schemes, Designs, Codes and Cryptography, 23 (2001), 283-290, MR 2002h:94080
11. R. Kannan, Improved algorithms for integer programming and related lattice problems, Proc. 15th ACM Symp. on Theory of Comput., Boston, MA, May 25-27, 1983, 193-206.
12. R. Kannan, Algorithmic geometry of numbers, Annual Review of Comp. Sci., 2 (1987), 231-267. MR 89a:11131
13. M. Kiwi, F. Magniez and M. Santha, Exact and approximate testing/coorecting of algebraic functions: A survey, Electronic Colloq. on Comp. Compl., Univ. of Trier, TR2001-014 (2001), 1-49.
14. S. V. Konyagin and I. E. Shparlinski, Character sums with exponential functions and their applications, Cambridge Univ. Press, Cambridge, 1999.
15. J. C. Lagarias, Pseudorandom number generators in cryptography and number theory, Proc. Symp. in Appl. Math., Amer. Math. Soc., Providence, RI, 42 (1990), 115-143. MR 92f:11109
16. A. K. Lenstra, H. W. Lenstra and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, 261 (1982), 515-534. MR 84a:12002
17. P. MacKenzie, On the security of the SPEKE Password-authenticated key exchange protocol, Cryptology ePrint Archive, Report 2001/57, 2001, 1-19.
18. D. Micciancio, On the hardness of the shortest vector problem, PhD Thesis, MIT, 1998.
19. P. Q. Nguyen, The dark side of the Hidden Number Problem: Lattice attacks on DSA, Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999, Birkhäuser, 2001, 321-330.
20. P. Q. Nguyen and I. E. Shparlinski, The insecurity of the Digital Signature Algorithm with partially known nonces, J. Cryptology. 15 (2002), 152-176.
21. P. Q. Nguyen and I. E. Shparlinski, The insecurity of the elliptic curve Digital Signature Algorithm with partially known nonces, Designs, Codes and Cryptography, (to appear).
22. P. Q. Nguyen and J. Stern, Lattice reduction in cryptology: An update, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1838 (2000), 85-112. MR 2002h:94064
23. P. Q. Nguyen and J. Stern, The two faces of lattices in cryptology, Cryptology and Lattices (Providence, RI, 2001), Lecture Notes in Computer Sci., vol. 2146, Springer-Verlag, Berlin, 2001, pp. 146-180.
24. R. L. Rivest, A. Shamir and D. A. Wagner, Time-lock puzzles and timed-release crypto, Preprint, 1996, 1-9.
25. A.-R. Sadeghi and M. Steiner, Assumptions related to discrete logarithms; Why subtleties make a real difference, Led, Notes in Comp. Sci., Springer-Verlag, Berlin, 2045 (2001), 243-260.
26. C. P. Schnorr, A hierarchy of polynomial time basis reduction algorithms, Theor. Comp. Sci., 53 (1987), 201-224. MR 89h:11085
27. I. E. Shparlinski, Sparse polynomial approximation in finite fields, Proc. 33rd ACM Symp. on Theory of Comput., Crete, Greece, July 6-8, 2001, 209-215.
28. x2, Inform. Proc. Letters, 83 (2002), 109-113. CMP 2002:12
29. J. H. Silverman. The Arithmetic of Elliptic Curves. Springer-Verlag, Berlin, 1995. MR 95:11054
30. I. M. Vinogradov, Elements of number theory, Dover Publ., New York, 1954. MR 15:933e