Polynomial Factorisation using Drinfeld Modules - Archive ouverte HAL Access content directly
Journal Articles Newsletter of the London Mathematical Society Year : 2019

Polynomial Factorisation using Drinfeld Modules

Abstract

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.
Fichier principal
Vignette du fichier
feature_may_28-edits.pdf (1.13 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02368680 , version 1 (18-11-2019)

Identifiers

  • HAL Id : hal-02368680 , version 1

Cite

Anand Kumar Narayanan. Polynomial Factorisation using Drinfeld Modules. Newsletter of the London Mathematical Society, 2019. ⟨hal-02368680⟩
64 View
54 Download

Share

Gmail Facebook Twitter LinkedIn More