Post-Quantum Cryptography: Why It’s Secure

Konstantinos Karagiannis proves why lattice-based ML-KEM secures data after quantum computers arrive. SANS Emerging Threats Summit 2025 Lattice magic vs. Shor—learn how ML-KEM outpaces RSA and thwarts quantum attacks. Konstantinos Karagiannis, Director of Quantum Computing Services, Protiviti, explains the quantum threat to RSA/ECC and AES, then unpacks lattice-based cryptography and “learning with errors.” He contrasts RSA’s factorization with matrix math fortified by deliberate noise, proving why ML-KEM withstands classical and quantum adversaries. Performance charts reveal 90× faster decapsulation and lightspeed keygen, debunking fears of PQC slowdowns. Konstantinos also critiques NIST’s AES-128 guidance, urging AES-256, and maps the deprecation/disallow timeline—2030 for “deprecated,” 2035 for “disallowed.” Practical migration tips cover hybrid handshakes, MTU pitfalls and early browser support. Key Takeaways - Shor breaks RSA/ECC; Grover halves AES strength - Lattice-based ML-KEM resists both quantum and classical attacks - ML-KEM keys/decap beat RSA performance in real tests - 2030/2035 deadlines demand roadmap now - Adopt AES-256 for post-quantum symmetric strength View upcoming Summits: http://www.sans.org/u/DuS #EmergingThreatsSummit #PostQuantumCrypto #LatticeCryptography