Article Dans Une Revue Journal of Complexity Année : 2020

Fast multivariate multi-point evaluation revisited

Résumé

In 2008, Kedlaya and Umans designed the first multivariate multi-point evaluation algorithm over finite fields with an asymptotic complexity that can be made arbitrarily close to linear. However, it remains a major challenge to make their algorithm efficient for practical input sizes. In this paper, we revisit and improve their algorithm, while keeping this ultimate goal in mind. In addition we sharpen the known complexity bounds for modular composition of univariate polynomials over finite fields.

Fichier principal
Vignette du fichier
kucomp.pdf (468.59 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-01848571 , version 1 (24-07-2018)
hal-01848571 , version 2 (28-11-2020)

Licence

Identifiants

Citer

Joris van der Hoeven, Grégoire Lecerf. Fast multivariate multi-point evaluation revisited. Journal of Complexity, 2020, 56, pp.101405. ⟨10.1016/j.jco.2019.04.001⟩. ⟨hal-01848571v2⟩
412 Consultations
1579 Téléchargements

Altmetric

Partager

  • More