Security of currently deployed public-key cryptography algorithms is foreseen to be
vulnerable against quantum computer attacks. Hence, a community effort exists to develop …

We propose a hardware-optimized design that implements a Montgomery Elliptic-curve
point multiplication Algorithm over using Lopez-Dahab projective coordinates. Moreover, we …

Physically Unclonable Functions (PUFs) translate unavoidable variations in certain
parameters of materials, waves, or devices into random and unique signals. They have …

Elliptic Curve Cryptography (ECC), one of the most widely used asymmetric cryptographic
algorithms, has been deployed in Transport Layer Security (TLS) protocol, blockchain …

This paper presents a throughput/area-efficient hardware accelerator architecture for elliptic
curve point multiplication (ECPM) computation over GF (2 233). The throughput of the …

This work presents a scalable digit-parallel finite field polynomial multiplier architecture with
a digit size of 32 bits for NIST-standardized binary elliptic fields. First, a dedicated digit …

This article presents an area-efficient hardware architecture for the implementation of elliptic-
curve point multiplication (PM) operation over. The area is minimized through three …

This article presents an efficient crypto processor architecture for point multiplication
acceleration of side-channel secured Binary Huff Curves (BHC) on FPGA (field …

Elliptic Curve Cryptography (ECC) is a distinct and efficient public-key cryptography method
that balances security and performance well, with shorter key lengths. A primary component …

This paper presents a throughput/area-efficient hardware accelerator architecture for elliptic
curve point multiplication (ECPM) computation over GF (2233). The throughput of the …