Hardness of distinguishing the MSB or LSB of secret keys in Diffie-Hellman schemes

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

Volumn 4052 LNCS, Issue , 2006, Pages 240-251

  Fouque, Pierre Alain ^a   Pointcheval, David ^a   Stern, Jacques ^a   Zimmer, Sébastien ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Diffie Hellman transform; Exponential sums; Least significant bits; Randomness extraction

Indexed keywords

DECISION THEORY; FUNCTIONS; MATHEMATICAL MODELS; RANDOM PROCESSES;

DIFFIE-HELLMAN TRANSFORM; EXPONENTIAL SUMS; LEAST SIGNIFICANT BITS; RANDOMNESS EXTRACTION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33746347077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_21     Document Type: Conference Paper

References (34)

1. M. Abdalla, M. Bellare, and P. Rogaway. The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES. In CT - RSA '01, LNCS 2020, pages 143-158. Springer-Verlag, Berlin, 2001.
2. M. Bellare and P. Rogaway. Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In Proc. of the 1st CCS, pages 62-73. ACM Press, 1993.
3. I. F. Blake, T. Garefalakis, and I. E. Shparlinski. On the bit security of the Diffie-Hellman key. In Appl. Algebra in Engin., Commun, and Computing, volume 16, pages 397-404, 2006.
4. D. Boneh. The Decision Diffie-Hellman Problem. In J. P. Buhler, editor, Algorithmic Number Theory Symposium (ANTS III), LNCS 1423, pages 48-63. Springer-Verlag, Berlin, 1998.
5. D. Boneh and R. Venkatesan. Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes. In Crypto '96, LNCS 1109, pages 129-142. Springer-Verlag, Berlin, 1996.
6. D. Boneh and R. Venkatesan. Hounding in Lattices and its Cryptographic applications. In Proc. of ACM-SIAM SODA'97, pages 675-681, 1997.
7. 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 Mathmatiques, 337:75-80, 2003.
8. R. Canetti, J. Friedlander, S. Konyagin, M. Larsen, D. Lieman, and I. Shparlinski. On the Statistical Properties of Diffie-Hellman Distributions. Israel Journal of Mathematics, 120:23-46, 2000.
9. R. Canetti, J. Friedlander, and I. Shparlinski. On Certain Exponential Sums and the Distribution of Diffie-Hellman Triples. Journal of the London Mathematical Society, 59(2):799-812, 1999.
10. L. Carter and M. Wegman. Universal Hash Functions. Journal of Computer and System Sciences, 18:143-154, 1979.
11. O. Chevassut, P. A. Fouque, P. Gaudry, and D. Pointcheval. Key derivation and randomness extraction. Cryptology ePrint Archive, Report 2005/061, 2005. http://eprint.iacr.org/.
12. O. Chevassut, P. A. Fouque, P. Gaudry, and D. Pointcheval. The twist-augmented technique for key exchange. In PKC '06, LNCS 3958, pages 410-426. Springer-Verlag, Berlin, 2006.
13. J.-S. Coron, Y. Dodis, C. Malinaud, and P. Puniya. Merkle-Damgard Revisited: How to Construct a Hash Function. In Crypto '05, LNCS 3621, pages 430-448. Springer-Verlag, Berlin, 2005.
14. R. Cramer and V. Shoup. A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. In Crypto '98, LNCS 1462, pages 13-25. Springer-Verlag, Berlin, 1998.
15. W. Diffio and M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, November 1976.
16. Y. Dodis, R. Gennaro, J. Håstad, H. Krawczyk, and T. Rabin, Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes. In Crypto '04, LNCS, pages 494-510. Springer-Verlag, Berlin, 2004.
17. T. El Gamal. A. Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory, IT-31(4):469-472, July 1985.
18. R. Gennaro, H. Krawczyk, and T. Rabin. Secure Hashed Diffie-Hellman over Non-DDK Groups. In Eurocrypt '04, LNCS 3027, pages 361-381. Springer-Verlag, Berlin, 2004.
19. O. Goldreich and L.A. Levin. A Hard-Core Predicate for all One-Way Functions. In Proc. of the 21st STOC, pages 25-32. ACM Press, New York, 1989.
20. M. I. Gonzalez Vasco, M. Näslund, and I. E. Shparlinski. New results on the hardness of Diffie-Hellman bits. In PKC '04, LNCS 2947, pages 159-172, 2004.
21. M. I. Gonzalez Vasco and I. E. Shparlinski. On the security of Diffie-Hellman bits. In Proc. Workshop on Cryptography and Computational Number Theory Singapore, 1999, pages 331-342, Birkhauser, 2001.
22. N. Gürel. Extracting bits from coordinates of a point of an elliptic curve. Cryptology ePrint Archive, Report 2005/324, 2005. http://eprint.iacr. org/.
23. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A Pseudorandom Generator from any One-Way Function. SIAM Journal of Computing, 28(4):1364-1396, 1999.
24. D. R. Heath-Brown and S. Konyagin. New bounds for Gauss sums derived from kth powers, and for Heilbronn's exponential sum. Q. J. Math., 51(2):221-235, 2000.
25. R. Impagliazzo and D. Zuckerman. How to recycle random bits. In Proc. of the 30th FOCS, pages 248-253. IEEE, New York, 1989.
26. S. V. Konyagin and I. Shparlinski. Character Sums With Exponential Functions and Their Applications. Cambridge University Press, Cambridge, 1999.
27. N. M. Korobov. The distribution of digits in periodic fractions. Mat. Sb. (N.B.), 89(131):654-670, 672, 1972.
28. L. Trevisan and S. Vadhan. Extracting Randomness from Samplable Distributions. In Proc. of the 41st FOCS, pages 32-42. IEEE, New York, 2000.
29. S. Patel and G. Sundaram. An Efficient Discrete Log Pseudo Random Generator. In Crypto '98, LNCS 1462. Springer-Verlag, Berlin, 1998.
30. V. Shoup. Lower Bounds for Discrete Logarithms and Related Problems. In Eurocrypt '97, LNCS 1233, pages 256-266, Springer-Verlag, Berlin, 1997.
31. V. Shoup. Using Hash Functions as a Hedge against Chosen Ciphertext Attack. In Eurocrypt '00, LNCS 1807, pages 275-288. Springer-Verlag, Berlin, 2000.
32. V. Shoup. A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge, 2005.
33. V. Shoup and T. Schweinberger. ACE: The Advanced Cryptographic Engine. Manuscript, March 2000. Revised, August 14, 2000.
34. P. C. van Oorschot and M. J. Wiener. On Diffie-Hellman Key Agreement with Short Exponents. In Eurocrypt '96, LNCS 1070, pages 332-343. Springer-Verlag, Berlin, 1996.