Breakdown Resilience of Key Exchange Protocols: NewHope, TLS 1.3, and Hybrids

AuthorBrendel, Jacqueline; Fischlin, Marc; Günther, Felix
TypeConference Proceedings
AbstractBroken cryptographic algorithms and hardness assumptions are a constant threat to real-world protocols. Prominent examples are hash functions for which collisions become known, or number-theoretic assumptions which are threatened by advances in quantum computing. Especially when it comes to key exchange protocols, the switch to quantum-resistant primitives has begun and aims to protect today's secrets against future developments, moving from common Diffie--Hellman-based solutions to Learning-With-Errors-based approaches, often via intermediate hybrid designs.
Conference24th European Symposium on Research in Computer Security
SerieLecture Notes in Computer Science
InESORICS 2019: Computer Security - ESORICS 2019, p.521-541