Cryptology ePrint Archive: Report 2022/438

Computing isogenies between finite Drinfeld modules

Benjamin Wesolowski

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

Category / Keywords: public-key cryptography / isogeny-based cryptography, Drinfeld modules, cryptanalysis

Date: received 6 Apr 2022, last revised 6 Apr 2022

Contact author: benjamin wesolowski at math u-bordeaux fr

Available format(s): PDF | BibTeX Citation

Version: 20220406:132357 (All versions of this report)

Short URL: ia.cr/2022/438


[ Cryptology ePrint archive ]