"Time and Query Complexity Tradeoffs for the Dihedral Coset Problem."

Maxime Remaud, André Schrottenloher, Jean-Pierre Tillich (2023)

> Home

Details and statistics

DOI: 10.1007/978-3-031-40003-2_19

access: closed

type: Conference or Workshop Paper

metadata version: 2023-11-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/pqcrypto/RemaudST23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pqcrypto/RemaudST23
Maxime Remaud, André Schrottenloher, Jean-Pierre Tillich:
Time and Query Complexity Tradeoffs for the Dihedral Coset Problem. PQCrypto 2023: 505-532

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.