On the generalised hidden number problem and bit security of XTR

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

Volumn 2227, Issue , 2001, Pages 268-277

  Shparlinski, Igor E ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIFFIE HELLMAN; GENERALISATION;

ALGEBRA;

EID: 84974695972     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45624-4_28     Document Type: Conference Paper

References (26)

1. 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.
2. D. Boneh and R. Venkatesan, Rounding in lattices and its cryptographic applications, Proc. 8th AnnualA CM-SIAM Symp. on Discr. Algorithms, ACM, NY, 1997, 675–681.
3. A. E. Brouwer, R. Pellikaan and E. R. Verheul, Doing more with fewer bits, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1716 (1999), 321–332.
4. R. Canetti, J. B. Friedlander, S. Konyagin, M. Larsen, D. Lieman and I. E. Shparlinski, On the statistical properties of Diffie–Hellman distributions, IsraelJ. Math., 120 (2000), 23–46.
5. E. ElMahassni, P. Q. Nguyen and I. E. Shparlinski, The insecurity of Nyberg–Rueppel and other DSA-like signature schemes with partially known nonces, Proc. Workshop on Lattices and Cryptography, Boston, MA, 2001 (to appear).
6. J. B. Friedlander, M. Larsen, D. Lieman and I. E. Shparlinski, On correlation of binary M-sequences, Designs, Codes and Cryptography, 16 (1999), 249–256.
7. M. I. González Vasco and I. E. Shparlinski, On the security of Diffie-Hellman bits, Proc. Workshop on Cryptography and ComputationalNum ber Theory, Singapore 1999, Birkhäuser, 2001, 257–268.
8. M. I. González Vasco and I. E. Shparlinski, Security of the most significant bits of the Shamir message passing scheme, Math. Comp. (to appear).
9. N. A. Howgrave-Graham and N. P. Smart, Lattice attacks on digital signature schemes, Designs, Codes and Cryptography, (to appear).
10. R. Kannan, Algorithmic geometry of numbers, Annual Review of Comp. Sci., 2 (1987), 231–267.
11. R. Kannan, Minkowski’s convex body theorem and integer programming, Math. Of Oper. Research, 12 (1987), 231–267.
12. S. V. Konyagin and I. Shparlinski, Character sums with exponential functions and their applications, Cambridge Univ. Press, Cambridge, 1999.
13. A. K. Lenstra, H. W. Lenstra and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, 261 (1982), 515–534.
14. A. K. Lenstra and E. R. Verheul, The XTR public key system, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1880 (2000), 1–19.
15. A. K. Lenstra and E. R. Verheul, Key improvements to XTR, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1976 (2000), 220–233.
16. R. Lidland H. Niederreiter, Finite fields, Cambridge University Press, Cambridge, 1997.
17. D. Micciancio, On the hardness of the shortest vector problem, PhD Thesis, MIT, 1998.
18. P. Q. Nguyen, The dark side of the Hidden Number Problem: Lattice attacks on DSA, Proc. Workshop on Cryptography and ComputationalNum ber Theory, Singapore 1999, Birkhäuser, 2001, 321–330.
19. P. Q. Nguyen and I. E. Shparlinski, The insecurity of the Digital Signature Algorithm with partially known nonces, Preprint, 2000, 1–26.
20. P. Q. Nguyen and I. E. Shparlinski, The insecurity of the elliptic curve Digital Signature Algorithm with partially known nonces, Preprint, 2001, 1–16.
21. P. Q. Nguyen and J. Stern, Lattice reduction in cryptology: An update, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1838 (2000), 85–112.
22. P. Q. Nguyen and J. Stern, ‘The two faces of lattices in cryptology’, Proc. Workshop on Lattices and Cryptography, Boston, MA, 2001, Springer-Verlag, Berlin, (to appear).
23. C. P. Schnorr, A hierarchy of polynomial time basis reduction algorithms, Theor. Comp. Sci., 53 (1987), 201–224.
24. I. E. Shparlinski, Security of polynomial transformations of the Diffie–Hellman key, Preprint, 2000, 1–8.
25. 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.
26. E. R. Verheul, Certificates of recoverability with scalable recovery agent security, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1751 (2000), 258–275.