DE FEO, Luca; KIEFFER, Jean; SMITH, Benjamin

doi:10.1007/978-3-030-03332-3_14

Métadonnées

Licence d’utilisation du document

DE FEO, Luca
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Laboratoire de Mathématiques de Versailles [LMV]

KIEFFER, Jean
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
École normale supérieure - Paris [ENS-PSL]

SMITH, Benjamin
Geometry, arithmetic, algorithms, codes and encryption [GRACE]
Institut de Mathématiques de Bordeaux [IMB]

Langue

Communication dans un congrès

Ce document a été publié dans

Lecture Notes in Computer Science, Lecture Notes in Computer Science, ASIACRYPT 2018 - 24th Annual International Conference on the Theory and Application of Cryptology and Information Security, 2018-12-02, Brisbane. vol. vol 11274

Springer, Cham

Résumé en anglais

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 encryp-tion, thus providing an important step towards efficient post-quantum non-interactive key exchange (NIKE).< Réduire

Mots clés en anglais

key exchange

elliptic curves

isogenies

post-quantum cryptography

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Towards practical key exchange from ordinary isogeny graphs

Langue

Ce document a été publié dans

Résumé en anglais

Mots clés en anglais

URI

DOI

Origine

Unités de recherche