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

researchr

You are not signed in
Sign in
Sign up

Dan Boneh, Ramarathnam Venkatesan. Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes. In Neal Koblitz, editor, Advances in Cryptology - CRYPTO 96, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings. Volume 1109 of Lecture Notes in Computer Science, pages 129-142, Springer, 1996. [doi]

This author has not been identified. Look up 'Dan Boneh' in GoogleThis author has not been identified. Look up 'Ramarathnam Venkatesan' in Google

runs on WebDSL