Name
Abstract | ||
|---|---|---|
key exchange is at the foundations of public-key cryptography, but conventional group-based is vulnerable to Shoru0027s quantum algorithm. A range of 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 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 as a basic component in more complicated constructions. In this survey we compare and contrast pre-and post-quantum algorithms, highlighting some important subtleties. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-05153-2_1 | IACR Cryptology ePrint Archive |
DocType | Volume | ISSN |
Journal | 2018 | Arithmetic of Finite Fields - WAIFI 2018, Jun 2018, Bergen,
Norway. pp.36, \&\#x27E8;10.1007/978-3-030-05153-2\_1\&\#x27E9 |
Citations | PageRank | References |
0 | 0.34 | 66 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin Smith | 1 | 30 | 5.54 |