Computing isogenies between finite Drinfeld modules
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|