In this study high‐performance and high‐speed field‐programmable gate array (FPGA)
implementations of polynomial basis Itoh–Tsujii inversion algorithm (ITA) over GF (2m) …

Shifted polynomial basis (SPB) and generalized polynomial basis (GPB) are two variations
of polynomial basis representation. SPB/GPB have potential for efficient bit-level and digit …

Spectrum sensing is a key step in cognitive radio communication systems. The probability of
detection and probability of false-alarm are two crucial performance parameters in spectrum …

Many cryptographic and error control coding algorithms rely on finite field arithmetic.
Hardware implementation of these algorithms requires an efficient realization of finite field …

In this paper, a scalable throughput/area efficient hardware implementation of polynomial
basis multiplication based on a digit-digit structure is presented. To compute multiplication …

This paper presents an area-time-efficient systolic structure for multiplication over GF (2 m)
based on irreducible all-one polynomial (AOP). We have used a novel cut-set retiming to …

Montgomery Multiplication is a common and important algorithm for improving the efficiency
of public key cryptographic algorithms, like RSA and Elliptic Curve Cryptography (ECC). A …

We present low area and low power semi-systolic array architectures for polynomial basis
multiplication over GF (2 m) using Progressive Multiplier Reduction Technique (PMR) …

Digit-serial polynomial basis multipliers over GF (2 m) are broadly applied in elliptic curve
cryptography, because squaring and polynomial reduction in GF (2 m) are simple …

This work presents a scalable digit-parallel finite field polynomial multiplier architecture with
a digit size of 32 bits for NIST-standardized binary elliptic fields. First, a dedicated digit …