In the past several years, there has been an increasing trend in the use of Radio Frequency
Identification (RFID) and Wireless Sensor Networks (WSNs) as well as in the integration of …

Novel systolic and super-systolic architectures are presented for polynomial basis
multiplication over GF (2 m) based on irreducible trinomials. By suitable cut-set retiming, we …

Multiplication and squaring are main finite field operations in cryptographic computations
and designing efficient multipliers and squarers affect the performance of cryptosystems. In …

Finite field accumulation is the simplest of all the finite field operations, but at the same time,
it is one of the most frequently encountered operations in finite field arithmetic. In this paper …

In this article, a new architecture of bit-serial polynomial basis (PB) multipliers over the
binary extension field GF (2 m) generated by irreducible trinomials is presented. Bit-serial …

In this paper, we present efficient algorithms for modular reduction to derive novel systolic
and non-systolic architectures for polynomial basis finite field multipliers over GF (2 m) to be …

In this paper, we propose an energy-efficient design of architecture for digit-serial
multiplication over generic GF (2 m), which could be used for different fields as and when …

Finite field multiplication is one of the most important operations in the finite field arithmetic.
Recently, a variation of the polynomial basis, which is known as the shifted polynomial …

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 …

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) …