Time and Query Complexity Tradeoffs for the Dihedral Coset Problem

Maxime Remaud, André Schrottenloher, Jean-Pierre Tillich. Time and Query Complexity Tradeoffs for the Dihedral Coset Problem. In Thomas Johansson 0001, Daniel Smith-Tone, editors, Post-Quantum Cryptography - 14th International Workshop, PQCrypto 2023, College Park, MD, USA, August 16-18, 2023, Proceedings. Volume 14154 of Lecture Notes in Computer Science, pages 505-532, Springer, 2023. [doi]

@inproceedings{RemaudST23,
  title = {Time and Query Complexity Tradeoffs for the Dihedral Coset Problem},
  author = {Maxime Remaud and André Schrottenloher and Jean-Pierre Tillich},
  year = {2023},
  doi = {10.1007/978-3-031-40003-2_19},
  url = {https://doi.org/10.1007/978-3-031-40003-2_19},
  researchr = {https://researchr.org/publication/RemaudST23},
  cites = {0},
  citedby = {0},
  pages = {505-532},
  booktitle = {Post-Quantum Cryptography - 14th International Workshop, PQCrypto 2023, College Park, MD, USA, August 16-18, 2023, Proceedings},
  editor = {Thomas Johansson 0001 and Daniel Smith-Tone},
  volume = {14154},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-40003-2},
}