"Hardness of Computing the Most Significant Bits of Secret Keys in ..."

Dan Boneh, Ramarathnam Venkatesan (1996)

> Home

Details and statistics

DOI: 10.1007/3-540-68697-5_11

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/crypto/BonehV96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/crypto/BonehV96
Dan Boneh, Ramarathnam Venkatesan:
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes. CRYPTO 1996: 129-142

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.