Design Space Exploration of a Unified FPGA Accelerator for Elliptic-Curve-Based Functions in Attribute-Based Encryption
Open Access
- 20 November 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 34 (2) , 579-592
Abstract
Attribute-based encryption (ABE) requires several elliptic-curve-based functions, including elliptic-curve scalar multiplication (ECSM), hashing to the curve, and pairing. Although these computations share underlying similarities, prior hardware designs have shown that distinct architectures yield better performance for each function. Consequently, it remains unclear which architecture offers optimal performance when supporting all required functions within a unified design. In this work, we present a design space exploration methodology in which the design is parameterized using a defined set of design parameters, and an automatic schedule generator is employed to estimate the cycle counts for each function. This allows us to identify the configuration that minimizes latency for both individual functions and complete cryptographic operations. The versatility of our approach is demonstrated through two case studies: 1) ECSM over Curve25519, Secp256k1, NIST-P256, and NIST-P384; and 2) multiple elliptic-curve functions over the BLS12-381 curve. In the first case, the optimal configuration implemented on a Virtex7 field-programmable gate array (FPGA) achieves up to a 15% latency reduction compared to state-of-the-art designs. In the second case, the unified accelerator in its optimal configuration supports all core ABE functions and achieves superior latency or throughput-per-area (TPA), and in some cases both, compared to existing designs.Keywords
Funding Information
- KIOXIA Holdings Corporation
This publication has 35 references indexed in Scilit:
- A Compact and Low Latency SPM Architecture for ECC CryptosystemsIEEE Access, 2024
- GMC-crypto: Low latency implementation of ECC point multiplication for generic Montgomery curves over GF(p)Journal of Parallel and Distributed Computing, 2024
- High-Performance BLS12-381 Pairing Engine on FPGA2023
- Hardware Acceleration of Aggregate Signature Generation and Authentication by BLS Signature over BLS12-381 curve2022
- A high speed processor for elliptic curve cryptography over NIST prime fieldIET Circuits, Devices & Systems, 2022
- Simplifying Design and Analysis of Complex Predicate Encryption Schemes2017
- A Compact and Exception-Free Ladder for All Short Weierstrass Elliptic Curves2017
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization2011
- Weierstraß Elliptic Curves and Side-Channel Attacks2002
- Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems1999