NOTE ON MODULAR REDUCTION IN EXTENDED FINITE FIELDS AND POLYNOMIAL RINGS FOR SIMPLE HARDWARE

Marek Repka

   Modular reduction in extended finite fields is presented, which once implemented works for any random reduction polynomial without changes of the hardware. It is possible to reduce polynomials of whatever degree. Based on the principal defined, two example RTL architectures are designed, and some useful features are noted furthermore.

Keywords: modular reduction, extended finite fields, extended polynomial rings

[full-paper]