International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes

Authors:
Dan Boneh
Ramarathnam Venkatesan
Download:
DOI: 10.1007/3-540-68697-5_11 (login may be required)
Search ePrint
Search Google
Conference: CRYPTO 1996
BibTeX
@inproceedings{crypto-1996-1086,
  title={Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes},
  booktitle={Advances in Cryptology - CRYPTO '96, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={1109},
  pages={129-142},
  doi={10.1007/3-540-68697-5_11},
  author={Dan Boneh and Ramarathnam Venkatesan},
  year=1996
}