Name
Abstract | ||
|---|---|---|
We revisit the ordinary isogeny-graph based cryptosystems of Couveignes and Rostovtsev–Stolbunov, long dismissed as impractical. We give algorithmic improvements that accelerate key exchange in this framework, and explore the problem of generating suitable system parameters for contemporary pre- and post-quantum security that take advantage of these new algorithms. We also prove the session-key security of this key exchange in the Canetti–Krawczyk model, and the IND-CPA security of the related public-key encryption scheme, under reasonable assumptions on the hardness of computing isogeny walks. Our systems admit efficient key-validation techniques that yield CCA-secure encryption, thus providing an important step towards efficient post-quantum non-interactive key exchange (NIKE). |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-03332-3_14 | IACR Cryptology ePrint Archive |
DocType | Volume | ISSN |
Journal | 2018 | ASIACRYPT 2018, Dec 2018, Brisbane, Australia |
Citations | PageRank | References |
5 | 0.44 | 31 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca De Feo | 1 | 62 | 7.36 |
| Jean-claude Kieffer | 2 | 5 | 2.13 |
| Benjamin Smith | 3 | 30 | 5.54 |