Dcryp-unit: Crypto hardware accelerator unit design for elliptic curve point multiplication

AR Alharbi, MM Hazzazi, SS Jamal, A Aljaedi… - IEEE …, 2024 - ieeexplore.ieee.org
We propose a hardware-optimized design that implements a Montgomery Elliptic-curve
point multiplication Algorithm over using Lopez-Dahab projective coordinates. Moreover, we …

[HTML][HTML] An experimental study of building blocks of lattice-based nist post-quantum cryptographic algorithms

M Imran, ZU Abideen, S Pagliarini - Electronics, 2020 - mdpi.com
Security of currently deployed public-key cryptography algorithms is foreseen to be
vulnerable against quantum computer attacks. Hence, a community effort exists to develop …

FPGA Implementation of Elliptic-Curve Point Multiplication over GF(2233) using Booth Polynomial Multiplier for Area-Sensitive Applications

A Aljaedi, FA Qureshi, MM Hazzazi, M Imran… - IEEE …, 2024 - ieeexplore.ieee.org
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 …

[HTML][HTML] Throughput/Area-Efficient Accelerator of Elliptic Curve Point Multiplication over GF(2233) on FPGA

M Rashid, OS Sonbul, MYI Zia, M Arif, A Sajid… - Electronics, 2023 - mdpi.com
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 …

Topgun: An ECC accelerator for private set intersection

G Wu, Q He, J Jiang, Z Zhang, Y Zhao, Y Zou… - ACM Transactions on …, 2023 - dl.acm.org
Elliptic Curve Cryptography (ECC), one of the most widely used asymmetric cryptographic
algorithms, has been deployed in Transport Layer Security (TLS) protocol, blockchain …

[Књига][B] Statistical trend analysis of physically unclonable functions: An approach via text mining

B Zolfaghari, K Bibak, T Koshiba, HR Nemati, P Mitra - 2021 - taylorfrancis.com
Physically Unclonable Functions (PUFs) translate unavoidable variations in certain
parameters of materials, waves, or devices into random and unique signals. They have …

[HTML][HTML] A scalable digit-parallel polynomial multiplier architecture for NIST-standardized binary elliptic curves

H Kumar, M Rashid, A Alhomoud, SZ Khan, I Bahkali… - Applied Sciences, 2022 - mdpi.com
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 …

A fast and efficient 191-bit Elliptic Curve Cryptographic Processor using a Hybrid Karatsuba Multiplier for IoT Applications

SS Dhanda, B Singh, CC Lin, P **dal, D Panwar… - IEEE …, 2024 - ieeexplore.ieee.org
The most widely used asymmetric cipher is ECC. It can be applied to IoT applications to offer
various security services. However, a wide range of sectors have been investigated for …

A Compact 3-stage Pipelined Hardware Accelerator for Point Multiplication of Binary Elliptic Curves over GF(2233)

MM Hazzazi, M Rashid, SS Jamal, F Alblehai… - IEEE …, 2024 - ieeexplore.ieee.org
This paper presents an area-compact hardware architecture for point multiplication (PM)
computation of elliptic curves over binary field. We have utilized two approaches with clock …

Hardware-Efficient ECC Processor Design using Non-Homogeneous Split Hybrid Karatsuba Multiplier

P Parate, A Shaju, SGK Reddy… - 2024 IEEE Computer …, 2024 - ieeexplore.ieee.org
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 …