FPGA Implementation of Elliptic-Curve Point Multiplication over GF(2233) using Booth Polynomial Multiplier for Area-Sensitive Applications
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 …
curve point multiplication (PM) operation over. The area is minimized through three …
A Universal Single and Double Point Multiplications Architecture for ECDSA Based on Differential Addition Chains
X He, W Wang, J Zhang, Z Zhang, J Yang… - IEEE …, 2024 - ieeexplore.ieee.org
In the 5G and beyond networks, low-latency digital signatures are essential to ensure the
security, integrity, and non-repudiation of massive data in communication processes. The …
security, integrity, and non-repudiation of massive data in communication processes. The …
Lookup Table-Based Design of Scalar Multiplication for Elliptic Curve Cryptography
YD Ning, YH Chen, CS Shih, SI Chu - Cryptography, 2024 - mdpi.com
This paper is aimed at using a lookup table method to improve the scalar multiplication
performance of elliptic curve cryptography. The lookup table must be divided into two …
performance of elliptic curve cryptography. The lookup table must be divided into two …