Breakdown Resilience of Key Exchange Protocols: NewHope, TLS 1.3, and Hybrids
Jacqueline Brendel, Marc Fischlin, Felix Günther
Broken 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.
•Jan 1, 2017•0 citations