High-performance and fast implementation of point multiplication is crucial for elliptic curve
cryptographic systems. Recently, considerable research has investigated the …

The use of e-commerce has been associated with a lot of skepticism and apprehension due
to some crimes associated with e-commerce and specifically to payment systems. The …

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 …

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 …

Edge computing in Internet of Things (IoT) requires high-performance as well as cost-
effective hardware implementations to accommodate large number of computations …

Linear feedback shift registers (LFSR) are widely used in many different areas. In this paper,
we study the operation of LFSR defined over extension fields GF (2n), instead of traditional …

This paper presents two efficient implementations of fast and pipelined bit-parallel
polynomial basis multipliers over GF (2< sup> m) by irreducible pentanomials and …

The demand for efficient large integer polynomial multiplications in present day crypto-
systems is the need of the hour. Karatsuba-like multiplication is one of the most efficient …

It is essential to have efficient large integer multiplications for current cryptosystems.
Karatsuba-like multiplication is one of the most efficient multiplication algorithms, but is …

The current demand for efficient multiplication of large integer polynomials in contemporary
cryptographic systems is crucial. This work explores the Karatsuba-like multiplication …