YoVDO

Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory - Session III

Offered By: QuICS via YouTube

Tags

Post-Quantum Cryptography Courses Quantum Computing Courses Cryptanalysis Courses Lattice-Based Cryptography Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a conference talk from PQCrypto 2023, the 14th International Conference on Post-Quantum Cryptography, focusing on classical and quantum approaches to solving the Shortest Vector Problem (SVP) with low memory requirements. Delve into the presentation by Johanna Loyer, part of Session III: Quantum I, which examines 3 and 4-sieves in both classical and quantum contexts. Learn about innovative techniques for addressing SVP, a fundamental problem in lattice-based cryptography, and gain insights into the potential implications for post-quantum cryptographic systems. This 19-minute talk offers a concise yet informative overview of cutting-edge research in the field, suitable for those interested in the intersection of quantum computing and cryptography.

Syllabus

PQCrypto 2023: Session III: Classical & quantum sieves to solve SVP with low memory (Johanna Loyer)


Taught by

QuICS

Related Courses

Lattices, Post-Quantum Security and Homomorphic Encryption
Simons Institute via YouTube
The Learning With Errors Problem and Cryptographic Applications
Simons Institute via YouTube
Fault Attacks on CCA-Secure Lattice KEMs
TheIACR via YouTube
Lattice-Based Cryptography
TheIACR via YouTube
Lattice-Based Cryptography
TheIACR via YouTube