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

High-precision integer multiplication is critical for applications in physics, mathematics, and
most importantly, encryption. Existing multiplication algorithms must process every bit of the …

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 …

The complexity of multipliers used to generate large random keys in cryptographic systems
contributes to the complexity of the entire cryptographic system, hence making it essential to …

In the era of the post-quantum Internet of Things (IoT), the implementation of anti-quantum
cryptographic algorithms in numerous terminals can successfully defend against prospective …