In this paper, we presented a method of minimizing the number of overlapped partial
products in the accumulation of four-term Karatsuba multiplication. This method reduced the …

Binary polynomial multipliers impact the overall performance and cost of elliptic curve
cryptography (ECC) systems. Multiplication algorithms with subquadratic computational …

In this paper, we propose a novel method of modular multiplication which embeds the
modular reduction in the evaluation and interpolation parts of the Karatsuba-like …

Isogeny-based schemes often come with special requirements on the field of definition of the
involved elliptic curves. For instance, the efficiency of SQIsign, a promising candidate in the …

Efficient computation of polynomial multiplication over characteristic three fields is required
for post-quantum cryptographic applications which gain importance upon the recent …

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 …

Bitslicing is a programming technique that offers several attractive features, such as timing
attack resistance, high amortized performance in batch computation, and architecture …

This paper focusses on FPGA-based optimized implementations of asymmetrical three-term
Karatsuba multiplication (AThTKM) architecture. Two multiplications, AThTKM-I and AThTKM …

This paper introduces a new polynomial multiplication algorithm which decreases the
arithmetic complexity and another modified algorithm that speeds up the implementation run …

Encryption and decryption have been integrated into all communication devices, and Elliptic
Curve Cryptography (ECC) has been widely used as a prominent protocol in data security …