You are looking at a specific version 20220406:132357 of this paper.
See the latest version.
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 cryptographyDrinfeld modulescryptanalysis
- 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
