With the recent advances in quantum computing, code-based cryptography is foreseen to be
one of the few mathematical solutions to design quantum resistant public-key cryptosystems …

Cryptography systems have become inseparable parts of almost every communication
device. Among cryptography algorithms, public-key cryptography, and in particular elliptic …

This work presents a versatile and flexible generator of various large integer polynomial
multipliers to be used in hardware cryptocores. Flexibility is offered by allowing circuit …

Finite field multiplication is a fundamental and frequently used operation in various
cryptographic circuits and systems. Because of its high complexity, this operation generally …

Abstract The finite field Modular Multiplier (MM) over GF (2 m) based on the National Institute
of Standards and Technology (NIST) recommended polynomials can be used as a critical …

High-performance (HP) elliptic curve scalar multiplication (ECSM) hardware
implementations hold significant importance in ensuring communication security in high …

Hardware-efficient polynomial multipliers are desired to satisfy the ever-growing demands of
computing within the finite field space toward develo** a strong cryptosystems. This …

Toom-Cook multiplication algorithm is one of the most efficient method compared to other
traditional large-integer multiplication algorithms. However, in most cases, implementation of …

Finite-field multipliers progressively plays a crucial role in modern cryptography systems.
While much attention has been given to the development of area-efficient Karatsuba …

Cryptography primitives have a prominent role in securing applications that may require low-
area realizations, for example portable devices and other resource constrained devices. A …