Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes

Dan Boneh and Ramarathnam Venkatesan

Details

Publication typeInproceedings
Published inCRYPTO
Pages129-142
> Publications > Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes