Using the concept of common components, this letter shows that field multiplication and
squaring over GF (2m) can be efficiently combined, with little hardware overhead. The …

In this study, we present an efficient finite field arithmetic architecture based on systolic array
for multiplication which is a core algorithm for division and exponentiation operations. In …

In this letter, we propose a low-latency semi-systolic architecture for multiplication based on
the shifted polynomial basis over finite fields. The proposed multiplier saves at least 49.9 …

Finite field arithmetic has been extensively used in error correcting codes and cryptography.
Low-complexity and high-speed designs for finite field arithmetic are needed to meet the …

This letter presents a low-complexity semi-systolic array implementation for polynomial
multiplication over GF (2m). We consider finite field Montgomery modular multiplication …

Multiplication is an essential operation in cryptographic computations. One of the important
finite fields for such computations is the binary extension field. High-throughput low …

In this paper, we propose a multiplexer based scheme that performs modular AB 2
multiplication using redundant basis over finite field. Then we propose an efficient …

In this paper, we derive a common computational part in an algorithm that can
simultaneously perform multiplication and square over finite fields, and propose a low-area …

In this paper, we present a scheme to compute either AB or AB 2 multiplications over GF (2
m) and propose a bit-parallel systolic architecture based on the proposed algorithm. The AB …

In this paper, we propose an efficient AB 2 multiplication algorithm using SPB (shifted
polynomial basis) over finite fields. Using the feature of the SPB, we split the equation for AB …