Explore the intricacies of the Dihedral Coset Problem in this 23-minute conference talk from PQCrypto 2023, the 14th International Conference on Post-Quantum Cryptography. Delve into the Session III: Quantum I presentation, where André Schrottenloher, along with co-authors Maxime Remaud and Jean-Pierre Tillich, discusses time and query complexity tradeoffs for solving this mathematical challenge. Gain insights into the latest advancements in post-quantum cryptography and understand how these findings impact the field of quantum-resistant security algorithms.
Time and Query Complexity Tradeoffs for the Dihedral Coset Problem - Session III
Overview
Syllabus
PQCrypto 2023: Session III: Time and Query Complexity of Dihedral Cosets (André Schrottenloher)
Taught by
QuICS
Related Courses
-
Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory - Session III
-
New Algebraic Attacks on the McEliece Cryptosystem - Invited Talk
-
Non-Observable Quantum Random Oracle Model - Session III
-
Hardness of Scheme-Switching Between SIMD FHE Schemes - Session II
-
On the Quantum Security of HAWK - Session IV
-
Post-Quantum Signatures in DNSSEC via Request-Based Fragmentation - Session 5
