This paper presents two efficient implementations of fast and pipelined bit-parallel
polynomial basis multipliers over GF (2< sup> m) by irreducible pentanomials and …

Scalar multiplication in elliptic curve cryptography is the most expensive and time-
consuming operation. The elliptic curve cryptography attracted interest due to the …

SM4-GCM is an encryption algorithm with authentication function. The algorithm achieves
the purpose of data security and information integrity. The SM4-GCM algorithm …

This paper proposes a FPGA based efficient implementation of AES-GCM for wireless
applications. For AES engine, we apply the DACSE algorithm to achieve a compact S-box. A …

The higher number of iterations and longer pipeline delays are the major bottlenecks in the
performance of Elliptic Curve Cryptography (ECC). Being the core of the arithmetic unit, the …

This report describes the design and implementation results in FPGAs of a scalable
hardware architecture for computing modular multiplication in prime fields GF ($ p $), based …

Wireless body area networks (WBANs) have the potential to provide long-term monitoring
and real-time feedback of human physiological data. However, designing a secure data …

Bilinear pairings on elliptic curves are an active research field in cryptography. First
cryptographic protocols based on bilinear pairings were proposed by the year 2000 and …

[4] Miguel Morales-Sandoval, Ricardo De la Parra Aguirre, Hiram Galeana Zapién, and
Alejandro Galaviz Mosqueda. A three-tier approach for lightweight data security of body …

This paper presents two efficient implementations of fast and pipelined bit-parallel
polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The …