Bitslicing and the Method of Four Russians Over Larger Finite Fields

Details Bitslicing and the Method of Four Russians Over Larger Finite Fields Bitslicing and the Method of Four Russians Over Larger Finite Fields

2009-01-11

arxiv.org/abs/0901.1413v1

Computer Science

Mathematical Software

Scientific paper

We present a method of computing with matrices over very small finite fields of size larger than 2. Specifically, we show how the Method of Four Russians can be efficiently adapted to these larger fields, and introduce a row-wise matrix compression scheme that both reduces memory requirements and allows one to vectorize element operations. We also present timings which confirm the efficiency of these methods and exceed the speed of the fastest implementations the authors are aware of.

Affiliated with

Also associated with

No associations

Rating

Bitslicing and the Method of Four Russians Over Larger 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 Bitslicing and the Method of Four Russians Over Larger Finite Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bitslicing and the Method of Four Russians Over Larger Finite Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-258094