Hardness of computing the most significant bits of secret keys in diffie-hellman and related schemes

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

Volumn 1109, Issue , 1996, Pages 129-142

  Boneh, Dan ^a   Venkatesan, Ramarathnam ^b  

^a PRINCETON UNIVERSITY   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS;

DIFFIE HELLMAN; DIFFIE-HELLMAN KEY EXCHANGE; DIFFIE-HELLMAN KEY EXCHANGE PROTOCOL; ELGAMAL; MOST SIGNIFICANT BIT; PUBLIC KEY SYSTEMS; PUBLIC KEYS; SECRET KEY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84955621986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_11     Document Type: Conference Paper

References (15)

1. [ACGS88] W. Alexi, B. Chor, O. Goldreich, and C. Schnorr. RSA and Rabin functions: Certain parts are as hard as the whole. SIAM J. Computing, 17(2):194-209, Nov. 1988.
2. [Bab86] L. Babai. On Lovasz' lattice reduction and the nearest lattice point problem. Combinatorica, 6:1-13, 1986.
3. [B96] D. Bleichenbacher. Generating EIGamal Signatures without knowing the secret key EuroCrypt96, pp 10-18, 1996
4. [BV96] D. Boneh, R. Venkatesan. Basis reduction with a matrix norm and its applications. Manuscript, 1996.
5. [DH76] W. Diffie and M. Heilman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644-654, 1976.
6. [EG85] T. El-Gamal. A public key cryptosystem and a signature scheme based on the discrete logarithm. IEEE Transactions on Information Theory, 31(4):469 472, 1985.
7. [FHK*88] A. Frieze, J. Hastad, R. Kannan, J. Lagarias, and A. Shamir. Reconstructing Truncated Integer Variables Satisfying Linear Congruences. SIAM J. Computing, 17(2):262-280, 1988.
8. [GL] O. Goldreich, L.A. Levin. Hard core bits based on any one way function. In Proc. ACM Symp. on Theory of Computing 1989.
9. [Kob87] N. Koblitz. A course in number theory and cryptography. Springer-Verlag, 1987.
10. [LLL82] A. Lenstra, H. Lenstra, and L. Lovasz. Factoring polynomial with rational coefficients. Mathematíche Annalen, 261:515-534, 1982.
11. [MB89] S. Micali M. Bellare. Non-interactive oblivious transfer and applications. In Proc. CRYPTO 89, pages 547-557, 1989.
12. [Oka88] T. Okamoto. Encryption and Authentication Schemes Based on Public Key Systems. PhD thesis, Univ. of Tokyo, 1988.
13. [Schnorr] C, Schnorr. A hierarchy of polynomial time lattice basis reduction algorithms Theoretical Computer Science, 53:201-224,1987
14. [Schn94] C.P. Schnorr: Reduced Lattice Bases and Successive Minima. Combinatorics, Probability and Computing 3, (1994), 507-522.
15. [SS95] K. Sakurai and H Shizuya. Relationships among the computational powers of breaking discrete log cryptosystems. In Proc. EUROCRYPT 95, pages 341-355, May 1995.