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 …

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 …

This work presents a new concept to implement the elliptic curve point multiplication (PM).
This computation is based on a new modular arithmetic over Gaussian integer fields …

This paper presents efficient and fast hardware implementations of the complete point
multiplication on binary Edwards curves (BECs). The implementations are based on …

Finite field multiplication is one of the most important operations in the finite field arithmetic
and the main and determining building block in terms of overall speed and area in public …

This paper presents low-cost and fast hardware implementations of the complete point
multiplication on binary Edwards curves over finite fields. The implementations are based on …

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 …

This study presents an efficient and high‐speed very large‐scale integration implementation
of point multiplication on binary Edwards curves over binary finite field GF (2m) with …