Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem

• Published in: 2015 IEEE Symposium on Security and Privacy pp. 553 - 570
• Main Authors: Bos, Joppe W., Costello, Craig, Naehrig, Michael, Stebila, Douglas
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.05.2015
• Subjects: Authentication; Computers; Cryptography; key exchange; Lattices; learning with errors; post-quantum; Protocols; Quantum computing; Transport Layer Security (TLS)
• ISSN: 1081-6011
• DOI: 10.1109/SP.2015.40

Lattice-based cryptographic primitives are believed to offer resilience against attacks by quantum computers. We demonstrate the practicality of post-quantum key exchange by constructing cipher suites for the Transport Layer Security (TLS) protocol that provide key exchange based on the ring learning with errors (R-LWE) problem, we accompany these cipher suites with a rigorous proof of security. Our approach ties lattice-based key exchange together with traditional authentication using RSA or elliptic curve digital signatures: the post-quantum key exchange provides forward secrecy against future quantum attackers, while authentication can be provided using RSA keys that are issued by today's commercial certificate authorities, smoothing the path to adoption. Our cryptographically secure implementation, aimed at the 128-bit security level, reveals that the performance price when switching from non-quantum-safe key exchange is not too high. With our R-LWE cipher suites integrated into the Open SSL library and using the Apache web server on a 2-core desktop computer, we could serve 506 RLWE-ECDSA-AES128-GCM-SHA256 HTTPS connections per second for a 10 KiB payload. Compared to elliptic curve Diffie-Hellman, this means an 8 KiB increased handshake size and a reduction in throughput of only 21%. This demonstrates that provably secure post-quantum key-exchange can already be considered practical.