Modular squaring in binary field arithmetic

Details Modular squaring in binary field arithmetic Modular squaring in binary field arithmetic

G - Physics

06

F

G06F 7/72 (2006.01) H04W 12/02 (2009.01) H04L 9/28 (2006.01)

Patent

CA 2642421

After squaring an element of a binary field, the squaring result may be reduced modulo the field-defining polynomial g bits at a time. To this end, a lookup table may be employed, where the lookup table stores entries corresponding to reducing g-bit-long polynomials modulo the field-defining polynomial. Such a reducing strategy may be shown to be more efficient than a bit-by-bit reducing strategy.

Affiliated with

Also associated with

Rating

Modular squaring in binary field arithmetic does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Modular squaring in binary field arithmetic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modular squaring in binary field arithmetic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1941140