The multiplicative inversion operation is a fundamental computation in several cryptographic
applications. In this work, we propose a scalable VLSI hardware to compute the Montgomery …

Computing the inverse of a number in finite fields GF (p) or GF (2 n) is equally important for
cryptographic applications. This paper proposes a novel scalable and unified architecture …

Modular inverse computation is needed in several public key cryptographic applications. In
this work, we present two VLSI hardware implementations used in the calculation of …

This study presents an efficient division architecture using restricted irreducible polynomial
on elliptic curve cryptosystem (ECC), based on cellular automata. The most expensive …

The computation of the inverse of a number in finite fields, namely Galois Fields GF (p) or GF
(2 n), is one of the most complex arithmetic operations in cryptographic applications. In this …

The Montgomery inversion is a fundamental computation in several cryptographic
applications. We propose a scalable hardware architecture to compute the Montgomery …

This study presents an efficient exponent architecture for public-key cryptosystems using
Montgomery multiplication based on programmable cellular automata (PCA). Multiplication …

This study presents a Montgomery multiplication architecture that uses an irreducible all one
polynomial (AOP) in GF (2m) based on a programmable cellular automata (PCA). The …

In this short note, we describe a simple polynomial division circuit based on a left shift
register. The circuit essentially performs the modulo operation f (x) mod p (x). It is shown how …

Cellular Automata (CA) has been used in evolutionary computation for over a decade and
Elliptic Curve Cryptography (ECC) has recently received a lot of attention due to their …