Modular reduction in extended finite fields and polynomial rings 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. The first architecture is sequential and reduce whatever degree polynomials, taking 2 cycles per term. The second one is Parallel and designed for reduction of polynomials of 2(
Keywords
- modular reduction
- extended finite fields
- extended polynomial rings
- algebraic codes
- McEliece PKC
- Niederreiter PKC
Probabilistic three-phase power flow in a distribution system applying the pseudo-inverse and cumulant method Spectral and energy efficiency trade-off in massive MIMO systems using multi-objective bat algorithm Observability, controllability and stability of a nonlinear RLC circuit in form of a Duffing oscillator by means of theoretical mechanical approach Influence of temperature on detectable minimum rotation rate in i-FOGs using Er-doped SFSs Smart DTC algorithm with automatic torque ripple adjustment Decentralized controlled charging and vehicle-to-grid solution for voltage regulation in low voltage distribution systems A novel principal component-based virtual sensor approach for efficient classification of gases/odors Multi-UAV integrated HetNet for maximum coverage in disaster management Investigation of field free region formed by dual Halbach array for focused magnetic hyperthermia Study of subjective and objective quality assessment of infrared compressed images