Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02368680
Contributor : Anand Kumar Narayanan <>
Submitted on : Monday, November 18, 2019 - 4:08:43 PM
Last modification on : Friday, March 27, 2020 - 3:48:58 AM

File

feature_may_28-edits.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02368680, version 1

Citation

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

Share

Metrics

Record views

34

Files downloads

34