"A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem."

Michael Drmota, Daniel Panario (2002)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2019-06-17

- no documents available
- export record
  dblp key:
  - journals/dcc/DrmotaP02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcc/DrmotaP02
Michael Drmota, Daniel Panario:
A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem. Des. Codes Cryptogr. 26(1-3): 229-241 (2002)

a service of

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.