Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields

Details Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields

2008-08-30

arxiv.org/abs/0809.0063v1

Computer Science

Symbolic Computation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-613698