Time and Query Complexity Tradeoffs for the Dihedral Coset Problem - Session III
Offered By: QuICS via YouTube
Course Description
Overview
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.
Syllabus
PQCrypto 2023: Session III: Time and Query Complexity of Dihedral Cosets (André Schrottenloher)
Taught by
QuICS
Related Courses
Intro to Computer ScienceUniversity of Virginia via Udacity Quantum Mechanics for IT/NT/BT
Korea University via Open Education by Blackboard Emergent Phenomena in Science and Everyday Life
University of California, Irvine via Coursera Quantum Information and Computing
Indian Institute of Technology Bombay via Swayam Quantum Computing
Indian Institute of Technology Kanpur via Swayam