Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields

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

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00315772
Contributor : Jean-Guillaume Dumas <>
Submitted on : Saturday, August 30, 2008 - 3:29:55 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM
Long-term archiving on : Tuesday, June 28, 2011 - 12:29:56 PM

Files

srktechrep.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy. Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields. Journal of Symbolic Computation, Elsevier, 2011, 46 (7), pp.823-840. ⟨10.1016/j.jsc.2010.08.015⟩. ⟨hal-00315772⟩

Share

Metrics

Record views

703

Files downloads

406