"On Search Complexity of Discrete Logarithm."

Pavel Hubácek, Jan Václavek (2021)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2021.60

access: open

type: Conference or Workshop Paper

metadata version: 2023-03-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/HubacekV21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/HubacekV21
Pavel Hubácek, Jan Václavek:
On Search Complexity of Discrete Logarithm. MFCS 2021: 60:1-60:16

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.