Paper
9 February 2024 FPGA-based multipliers for elliptic curve cryptography
Hongfei Ke, Peiyong Zhang
Author Affiliations +
Proceedings Volume 13073, Third International Conference on High Performance Computing and Communication Engineering (HPCCE 2023); 1307312 (2024) https://doi.org/10.1117/12.3026399
Event: Third International Conference on High Performance Computing and Communication Engineering (HPCCE 2023), 2023, Changsha, China
Abstract
This paper presents an approach to build large-integer multipliers for Elliptic Curve Cryptography (ECC). Compared to the traditional divide and conquer method, our method introduces the š¯‘›-term Karatsuba-like algorithm and adopts a cascaded structure for integer multiplications, which simplifies the complexity of the whole structure and contributes to a fine-grained multiplier design. Target at the required width of random elliptic curves over prime fields, we implement the design on virtex-7 FPGA and utilize internal DSPs as the fundamental multiplier resources. The synthesis results are compared quantitatively in terms of designs with different parameters and demonstrate the flexibility of our method.
(2024) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Hongfei Ke and Peiyong Zhang "FPGA-based multipliers for elliptic curve cryptography", Proc. SPIE 13073, Third International Conference on High Performance Computing and Communication Engineering (HPCCE 2023), 1307312 (9 February 2024); https://doi.org/10.1117/12.3026399
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital signal processing

Design

Cryptography

Field programmable gate arrays

Mathematical optimization

Back to Top