"Comparison of the complexity of Diffie-Hellman and discrete logarithm ..."

Mikhail Cherepniov (2020)

> Home

Details and statistics

DOI: 10.1007/S11416-020-00355-X

access: closed

type: Journal Article

metadata version: 2020-11-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/virology/Cherepniov20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/virology/Cherepniov20
Mikhail Cherepniov:
Comparison of the complexity of Diffie-Hellman and discrete logarithm problems. J. Comput. Virol. Hacking Tech. 16(4): 265-268 (2020)

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.