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

Dan Boneh and Ramarathnam Venkatesan
1996

In  CRYPTO

Details

TypeInproceedings
Pages129-142
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes