[Resource Topic] 2018/485: Towards practical key exchange from ordinary isogeny graphs

Welcome to the resource topic for 2018/485

Towards practical key exchange from ordinary isogeny graphs

Authors: Luca De Feo, Jean Kieffer, Benjamin Smith


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.

ePrint: https://eprint.iacr.org/2018/485

Slides: https://asiacrypt.iacr.org/2018/files/SLIDES/THURSDAY/P512/1045-1200/asiacrypt_kieffer.pdf

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .