Multiplication in Cyclotomic Rings and its Application to Finite Fields

Details Multiplication in Cyclotomic Rings and its Application to Finite Fields Multiplication in Cyclotomic Rings and its Application to Finite Fields

2008-07-23

arxiv.org/abs/0807.3699v1

Computer Science

Discrete Mathematics

Scientific paper

A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in cyclotomic rings and cyclotomic fields in that most arithmetic operations are done on vectors. From this formulation we can generate optimized algorithms for multiplication. For example, one of the proposed algorithms requires approximately half the number of coordinate-level multiplications at the expense of extra coordinate-level additions. Our method is then applied to the finite fields GF(q^m) to further reduce the number of operations. We then present optimized algorithms for multiplication in finite fields with type-I and type-II optimal normal bases.

Affiliated with

Also associated with

No associations

Rating

Multiplication in Cyclotomic Rings and its Application to 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 Multiplication in Cyclotomic Rings and its Application to Finite Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiplication in Cyclotomic Rings and its Application to Finite Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1221