YoVDO

Time and Query Complexity Tradeoffs for the Dihedral Coset Problem - Session III

Offered By: QuICS via YouTube

Tags

Post-Quantum Cryptography Courses Cryptography Courses Quantum Computing Courses Time Complexity Courses Cryptanalysis Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Internetwork Security
Indian Institute of Technology, Kharagpur via Swayam Classical Cryptosystems and Core Concepts
University of Colorado System via Coursera Cryptography and Information Theory
University of Colorado System via Coursera Cryptography And Network Security
Indian Institute of Technology, Kharagpur via Swayam An Introduction to Cryptography
Coventry University via FutureLearn