New results on the hardness of diffie-hellman bits

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

Volumn 2947, Issue , 2004, Pages 159-172

  Vasco, María Isabel González ^a   Näslund, Mats ^b   Shparlinski, Igor E ^c  

^a UNIVERSITY OF OVIEDO   (Spain)

^b ERICSSON RESEARCH   (Sweden)

^c MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; ECONOMIC AND SOCIAL EFFECTS; PUBLIC KEY CRYPTOGRAPHY;

COMPUTATIONAL MODEL; DIFFIE HELLMAN; ERROR RATE; MOST SIGNIFICANT BIT; NEW RESULTS; PUBLIC INFORMATION; PUBLIC VALUES; SECRET KEY;

HARDNESS;

EID: 31444456237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (35)

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., ACM, 2001, 601-610.
2. M. Bellare, A. Desai, D. Pointcheval and P. Rogaway, 'Relations among notions of security for public-key encryption schemes', Advances in Cryptology - Proceedings of CRYPTO'98. Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1462, 1998, 26-46.
3. M. Bellare and P. Rogaway, 'Random oracles are practical: a paradigm for designing efficient protocols', Proc. 1st ACM Computer and Communication Security' 93, ACM Press, 1993, 62-73.
4. M. Blum and S. Micali, 'How to generate cryptographically strong sequences of pseudo-random bits', SIAM J. Comp., 13, 1984, 850-864.
5. D. Boneh and I. E. Shparlinski, 'On the unpredictability of bits of the elliptic curve Diffie-Hellman scheme', Advances in Cryptology - CRYPTO 2001. Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2139, 2001, 201-212.
6. D. Boneh and R. Venkatesan, 'Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes', Advances in Cryptology - CRYPTO '96. Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1109, 1996, 129-142.
7. D. Boneh and R. Venkatesan, 'Rounding in lattices and its cryptographic applications', Proc. 8th Annual ACM-SIAM Symp. on Discr. Algorithms, ACM, 1997, 675-681.
8. J. Bourgain and S. V. Konyagin, 'Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order', Comptes Rendus Mathematique, 337 (2003), 75-80.
9. R. Canetti, O. Goldreich and S. Halevi. 'The random oracle model, revisited', Proc. 30th ACM Symp. on Theory of Comp., ACM, 1998, 209-218.
10. R. Cramer and V. Shoup 'Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption', Advances in Cryptology - EUROCRYPT 2002. Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2332, 2002, 45-64.
11. E. El Mahassni, P. Q. Nguyen and I. E. Shparlinski, 'The insecurity of Nyberg-Rueppel and other DSA-like signature schemes with partially known nonces', Cryptography and Lattices: International Conference, CaLC 2001. Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2146, 2001, 97-109.
12. R. Fischlin and C. P. Schnorr, 'Stronger security proofs for RSA and Rabin bits', J. Cryptology, 13, 2000, 221-244.
13. O. Goldreich and L. A. Levin, 'A hard core predicate for any one way function', Proc. 21st ACM Symp. on Theory of Comput., ACM, 1989, 25-32.
14. M. I. González Vasco and M. Näslund, 'A survey of hard core functions', Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999, Birkhäuser, 2001, 227-256.
15. M. I. González Vasco, M. Näslund and I. E. Shparlinski, 'The hidden number problem in extension fields and its applications', Proc. of LATIN 2002: Theoretical Informatics: 5th Latin American Symposium. Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2286, 2002, 105-117.
16. 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.
17. 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.
18. M. Grötschel, L. Lovász and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, Berlin, 1993.
19. G. Hast, 'Nearly one-sided tests and the Goldreich-Levin predicate', Advances in Cryptology - EUROCRYPT 2003. Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2656, 2003, 195-210.
20. J. Håstad and M. Näslund, 'The security of individual RSA and discrete log bits', J. of the ACM, (to appear).
21. D. R. Heath-Brown and S. V. Konyagin, 'New bounds for Gauss sums derived from fcth powers, and for Heilbronn's exponential sum', Ouart. J. Math., 51, 2000, 221-235.
22. N. A. Howgrave-Graham, P. Q. Nguyen and I. E. Shparlinski, 'Hidden number problem with hidden multipliers, timed-release crypto and noisy exponentiation', Math. Comp., 72, 2003, 1473-1485.
23. R. Kannan, 'Algorithmic geometry of numbers', Annual Review of Comp. Sci., 2, 1987, 231-267.
24. M. J. Kearns and U. V. Vazirani, An introduction to computational learning theory, MIT Press, Cambridge MA, 1994.
25. S. V. Konyagin and I. Shparlinski, Character sums with exponential functions and their applications, Cambridge Univ. Press, Cambridge, 1999.
26. W.-C. W. Li, M. Näslund and I. E. Shparlinski, 'The hidden number problem with the trace and bit security of XTR and LUG', Advances in Cryptology - CRYPTO 2002. Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2442, 2002, 433-448.
27. M. Näslund, I. E. Shparlinski and W. Whyte, 'On the bit security of NTRU', Proc of Public Key Cryptography - PKC 2003. Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2567, 2003, 62-70.
28. P. Q. Nguyen and I. E. Shparlinski, 'The insecurity of the digital signature algorithm with partially known nonces', J. Cryptology, 15, 2002, 151-176.
29. P. Q. Nguyen and I. E. Shparlinski, 'The insecurity of the elliptic curve digital signature algorithm with partially known nonces', Designs, Codes and Cryptography, 30 (2003), 201-217.
30. P. Q. Nguyen and J. Stern, 'Lattice reduction in cryptology: An update', Proc. of ANTS 2000. Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1838, 2000, 85-112.
31. P. Q. Nguyen and J. Stern, 'The two faces of lattices in cryptology', Proc. of CalC 2001. Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2146 (2001), 146-180.
32. C. P. Schnorr, 'Security of almost all discrete log bits', Electronic Colloq. on Comp. Compl., Univ. of Trier, TR98-033, 1998, 1-13.
33. V. Shoup, 'Lower bounds for discrete logaritlims and related problems', Preprint, available from http://www.shoup.net.
34. x2', Inform. Proc. Letters, 83, 2002, 109-113.
35. I. E. Shparlinski, Cryptographic applications of analytic number theory, Birkhauser, 2003.