CryptoDB
Computing isogenies between finite Drinfeld modules
Authors: |
|
---|---|
Download: | |
Abstract: | 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. |
BibTeX
@article{cic-2024-34112, title={Computing isogenies between finite Drinfeld modules}, journal={cic}, publisher={International Association for Cryptologic Research}, volume={1, Issue 1}, url={https://cic.iacr.org//p/1/1/12}, doi={10.62056/avommp-3y}, author={Benjamin Wesolowski}, year=2024 }