Computing isogenies between finite Drinfeld modules

Benjamin Wesolowski

Paper 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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint. MINOR revision.
Keywords: isogeny-based cryptography Drinfeld modules cryptanalysis
Contact author(s): benjamin wesolowski @ math u-bordeaux fr
History: 2022-04-06: revised; 2022-04-06: received; See all versions
Short URL: https://ia.cr/2022/438
License: CC BY

BibTeX

@misc{cryptoeprint:2022/438,
      author = {Benjamin Wesolowski},
      title = {Computing isogenies between finite Drinfeld modules},
      howpublished = {Cryptology ePrint Archive, Paper 2022/438},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/438}},
      url = {https://eprint.iacr.org/2022/438}
}