Polynomial Factorisation using Drinfeld Modules
Résumé
The arithmetic of Drinfeld modules have recently yielded novel algorithms for factoring polynomials over finite fields; a computational problem with applications to digital communication, cryptography and complexity theory. The following is a gentle invitation to these developments assuming no prior acquaintance with Drinfeld modules. Familiarity with finite fields and elliptic curves is helpful but not required.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|