Communications in Cryptology IACR CiC

Computing isogenies between finite Drinfeld modules


Benjamin Wesolowski
Benjamin Wesolowski ORCID
ENS de Lyon, CNRS, UMPA, UMR 5669, Lyon, France
benjamin dot wesolowski at ens-lyon dot fr


We prove that isogenies between Drinfeld F[x]-modules over a finite field can be computed in polynomial time. This breaks Drinfeld analogs of isogeny-based cryptosystems.


Perlas Caranay, Matthew Greenberg, and Renate Scheidler. Computing modular polynomials and isogenies of rank two drinfeld modules over finite fields. In 75 Years of Mathematics of Computation: Symposium on Celebrating 75 Years of Mathematics of Computation, November 1-3, 2018, the Institute for Computational and Experimental Research in Mathematics (ICERM), volume 754, 283. American Mathematical Soc., 2020.
Wouter Castryck, Tanja Lange, Chloe Martindale, Lorenz Panny, and Joost Renes. CSIDH: an efficient post-quantum commutative group action. In Thomas Peyrin and Steven D. Galbraith, editors, Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, volume 11274 of Lecture Notes in Computer Science, 395–427. Springer, 2018.
Jean Marc Couveignes. Hard homogeneous spaces. 2006.
David Jao and Luca De Feo. Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In Bo-Yin Yang, editor, International Workshop on Post-Quantum Cryptography – PQCrypto 2011, 19–34. 2011.
Antoine Joux and Anand Kumar Narayanan. Drinfeld modules may not be for isogeny based cryptography. 2019.
Antoine Leudière and Pierre-Jean Spaenlehauer. Hard homogeneous spaces from the class field theory of imaginary hyperelliptic function fields. 2022.

PDFPDF Open access

Submitted: 2024-01-07
Accepted: 2024-03-05
Published: 2024-04-09
How to cite

Benjamin Wesolowski, "Computing isogenies between finite Drinfeld modules," IACR Communications in Cryptology, vol. 1, no. 1, Apr 09, 2024, doi: 10.62056/avommp-3y.


Copyright is held by the author(s)

This work is licensed under a Creative Commons Attribution (CC BY) license.