Skip to Main content Skip to Navigation
New interface
Conference papers

Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies

Benjamin Smith 1 
1 GRACE - Geometry, arithmetic, algorithms, codes and encryption
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : Diffie-Hellman key exchange is at the foundations of public-key cryptography, but conventional group-based Diffie-Hellman is vulnerable to Shor's quantum algorithm. A range of "post-quantum Diffie-Hellman" protocols have been proposed to mitigate this threat, including the Couveignes, Rostovtsev-Stolbunov, SIDH, and CSIDH schemes, all based on the combinatorial and number-theoretic structures formed by isogenies of elliptic curves. Pre-and post-quantum Diffie-Hellman schemes resemble each other at the highest level, but the further down we dive, the more differences emerge-differences that are critical when we use Diffie-Hellman as a basic component in more complicated constructions. In this survey we compare and contrast pre-and post-quantum Diffie-Hellman algorithms, highlighting some important subtleties.
Document type :
Conference papers
Complete list of metadata

Cited literature [141 references]  Display  Hide  Download
Contributor : Benjamin Smith Connect in order to contact the contributor
Submitted on : Friday, December 13, 2019 - 11:44:33 AM
Last modification on : Thursday, January 20, 2022 - 5:27:41 PM


Files produced by the author(s)



Benjamin Smith. Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies. Arithmetic of Finite Fields - WAIFI 2018, Jun 2018, Bergen, Norway. pp.36, ⟨10.1007/978-3-030-05153-2_1⟩. ⟨hal-01872825v3⟩



Record views


Files downloads