21828 articles – 15613 Notices  [english version]
HAL : hal-00315772, version 1

Fiche détaillée  Récupérer au format
Journal of Symbolic Computation 46, 7 (2011) 823-840
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
Jean-Guillaume Dumas 1, Laurent Fousse 1, Bruno Salvy 2
(07/2011)

We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point arithmetic. The modular polynomials are converted into integers using Kronecker substitution (evaluation at a sufficiently large integer). With some control on the sizes and degrees, arithmetic operations on the polynomials can be performed directly with machine integers or floating point numbers and the number of conversions can be reduced. We also present efficient ways to recover the modular values of the coefficients. This leads to practical gains of quite large constant factors for polynomial multiplication, prime field linear algebra and small extension field arithmetic.
1 :  Laboratoire Jean Kuntzmann (LJK)
CNRS : UMR5224 – Université Joseph Fourier - Grenoble I – Université Pierre-Mendès-France - Grenoble II – Institut Polytechnique de Grenoble - Grenoble Institute of Technology
2 :  ALGORITHMS (INRIA Rocquencourt)
INRIA
Informatique/Calcul formel

Mathématiques/Théorie des nombres
Kronecker substitution – Finite field – Modular Polynomial Multiplication – REDQ (simultaneous modular reduction) – Small extension field – DQT (Discrete Q-adic Transform) – FQT (Fast Q-adic Transform) – Compressed modular matrix multiplication – Modular polynomial multiplication
Liste des fichiers attachés à ce document : 
PS
srktechrep.ps(398 KB)
PDF
srktechrep.pdf(328.1 KB)