Paper 2018/485 Original: eprint.iacr.org/2018/485 ↗
Towards practical key exchange from ordinary isogeny graphs
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2018-05-23: last updated
- 2018-05-23: published
- Short URL
- https://ia.cr/2018/485
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2018/485,
author = {Luca De Feo and Jean Kieffer and Benjamin Smith},
title = {Towards practical key exchange from ordinary isogeny graphs},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/485},
year = {2018},
url = {https://eprint.iacr.org/2018/485}
}