Hardware implementation of modern crypto devices paves the way for a special type of
cryptanalysis, which is known as side channel analysis (SCA) attacks. These attacks are …

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 …

Complex division is commonly used in various applications in signal processing and control
theory including astronomy and nonlinear RF measurements. Nevertheless, unless …

Elliptic curve cryptosystems (ECC) are well suited to devices with limited memory and
processing capabilities, such as smart cards, as well as devices with limited power, such as …

This study presents the design and implementation of an efficient structure for fault tolerant
bit‐parallel polynomial basis multiplication and squaring over GF (2m), based on a similar …

In this paper, a scalable bit-parallel word-serial (BPWS) finite field multiplier with fault
detection capability on binary extension fields is proposed for elliptic curve cryptography …

Fault detection is becoming more and more essential to the cryptographic circuits protection
(for the purpose of fighting against both natural and malicious faults). While finite field …

This paper presents two efficient cellular automata based Montgomery AB 2 multipliers for
exponentiation in finite fields GF (2 m) using a polynomial representation. The proposed …

Finite field multiplier is widely applied in many domains such as coding theory and
cryptography. In this paper, it is purposed to propose a concurrent all-cell error detection …

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 …