Sep 2026· IACR Transactions on Cryptographic Hardware and Embedded Systems· 0 citations· 48 references
TL;DR
This work proposes a unified framework to efficiently support Number Theoretic Transform (NTT) workloads in both FHE and ZKP, and designs limb-wise 256-bit arithmetic to efficiently support ZKP workloads using RVV.
Abstract
Data privacy has become increasingly critical in modern society, driving significant interest from both academia and industry in privacy-preserving technologies such as fully homomorphic encryption (FHE) and zero-knowledge proofs (ZKP). More recently, emerging paradigms such as verifiable FHE require the joint support of both cryptographic techniques, significantly increasing the diversity and complexity of underlying computational workloads. Prior hardware accelerators mainly target a single application or a narrow parameter range, making them ill-suited for supporting multiple cryptographic primitives. As an emerging open platform, RISC-V combines general-purpose programmability with high-performance computation enabled by vector extensions such as RISC-V Vector Extension (RVV). In this work, we propose a unified framework to efficiently support Number Theoretic Transform (NTT) workloads in both FHE and ZKP. We observe that existing RVV-based NTT kernels fail to scale efficiently to large parameter sizes; while the four-step NTT algorithm reduces the transform size through decomposition, conventional parameter selection often leads to suboptimal performance. To address this, we introduce a model-guided decomposition strategy that automatically selects near-optimal parameters. In addition, we design limb-wise 256-bit arithmetic to efficiently support ZKP workloads using RVV. We implement our framework on a gem5-based out-of-order RISC-V core with RVV v1.0 support. Experimental results demonstrate that our approach significantly improves NTT performance across a wide range of parameters and provides an efficient execution substrate for both FHE and ZKP workloads. Specifically, our approach achieves up to 1.53x speedup over prior state-of-the-art RVV-based implementations on standalone NTTs, up to 6.15x speedup over OpenFHE on CKKS bootstrapping, and up to 1.35x speedup over libsnark on BN128-based workloads.
Cerium is a multi-GPU framework for large-scale FHE inference that combines a domain-specific language, an optimizing compiler, and a runtime system to automatically generate optimized GPU kernels, compress plaintext data, manage terabyte-scale memory footprints, and optimize multi-GPU communication.
Siddharth Jayashankar, Joshua Kim, Michael B. Sullivan et al.· Proceedings of the ACM SIGOP...· 0 citations
With the growing adoption of fully homomorphic encryption (FHE), improving its computational efficiency has become a key research focus, and designing dedicated accelerators remains an effective approach. Existing FHE accelerators achieve high performance but are often constrained by empirical design tendencies that fa...
Ying-Hao Yang, Fu-Yao Liu, Jin-Kai Zhang et al.· International Test Conferenc...· 0 citations
Lattice is introduced, a novel RISC-V TEE framework that enables scalable enclaves on commercial RISC-V platforms with a minimal Trusted Computing Base (TCB) and proposes a non-intrusive Secure Monitor design for the underlying firmware.
Yu Zhao, Jia-Bei He, Ming-Ru Xu et al.· ACM Transactions on Architec...· 0 citations
A unified perspective on the performance bottlenecks and design trade-offs of FPGA-based FHE accelerators is provided and offers practical guidance for future architecture development.
Lingyu Gong, Farhad Merchant· ACM Transactions on Reconfig...· 0 citations
This work presents a hardware-oriented design for accelerating the Monolith hash function on FPGA and proposes a dual-architecture framework consisting of a serial architecture and a parallel architecture to address different performance and resource constraints.
Cheng Chen, Gang-Qiang Yang, Hong-Chao Zhou et al.· ACM Transactions on Reconfig...· 0 citations