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

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

Metadatos

Licencia de uso del documento

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]

Idioma

Communication dans un congrès

Este ítem está publicado en

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

Resumen en inglés

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).< Leer menos

Palabras clave en inglés

key exchange

elliptic curves

isogenies

post-quantum cryptography

Metadatos

Compartir este ítem

Licencia de uso del documento

Towards practical key exchange from ordinary isogeny graphs

Idioma

Este ítem está publicado en

Resumen en inglés

Palabras clave en inglés

URI

DOI

Orígen

Centros de investigación