Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CRYPTO
/
Paper
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes.
Dan Boneh
,
Ramarathnam Venkatesan
Venue
A*
CRYPTO
Year
1996
Proceedings
CRYPTO
DBLP record
conf/crypto/BonehV96 ↗
Browse the full
CRYPTO paper archive
.