Providing error detection constructions for Internet of nano-Things in constrained
applications is of prominent importance. The Niederreiter cryptosystem falls into the category …

Advances in quantum computing have urged the need for cryptographic algorithms that are
low-power, low-energy, and secure against attacks that can be potentially enabled. For this …

Binary extension finite fields GF (2 m) have received prominent attention in the literature due
to their application in many modern public-key cryptosystems and error-correcting codes. In …

This paper presents complexity analysis [both in application-specific integrated circuits
(ASICs) and on field-programmable gate arrays (FPGAs)] and efficient FPGA …

Post-quantum cryptosystems based on QC-MDPC codes are designed to mitigate the
security threat posed by quantum computers to traditional public-key cryptography. The …

In this contribution, we derive a novel parallel formulation of the standard Itoh–Tsujii
algorithm for multiplicative inverse computation over the field GF (2 m). The main building …

The Itoh-Tsujii multiplicative inverse algorithm (ITA) forms an integral component of several
cryptographic implementations such as elliptic curve cryptography. For binary fields …

In this study high‐performance and high‐speed field‐programmable gate array (FPGA)
implementations of polynomial basis Itoh–Tsujii inversion algorithm (ITA) over GF (2m) …

In this article, we present a high-performance hardware architecture for Elliptic curve based
(authenticated) key agreement protocol “Elliptic Curve Menezes, Qu and …

Thus far, several papers reported concrete resource estimates of Shor's quantum algorithm
for solving the elliptic curve discrete logarithm problem (ECDLP). In this paper, we study …