TensorFHE+: Fully Homomorphic Encryption Acceleration Based on Linear Algebra
- 5 November 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (2) , 612-627
Abstract
Fully Homomorphic Encryption (FHE) enables encrypted data processing on untrusted cloud servers, crucial for privacy-sensitive applications. Despite its potential, performance overheads (about $10,000\times$ slower) limit adoption. ASIC accelerators outperform GPUs/FPGAs by optimizing specific operations but rely on costly 7nm processes and large on-chip memory, hindering cost-effective deployment. Balancing efficiency with manufacturing constraints remains critical. This paper presents TensorFHE+, a GPU-optimized FHE acceleration framework leveraging Tensor Cores to accelerate Number Theoretic Transform (NTT) operations. Key innovations include: 1) Decomposing CKKS kernels into vector/matrix operations for hardware utilization; 2) Vectorized modulo arithmetic; 3) Data layout optimization for memory efficiency. Evaluated on NVIDIA A100, TensorFHE+ outperforms TensorFHE[1] by $1.44\times$ in average (up to $1.69\times$ on ResNet-20) and surpasses prior GPU implementations [2], [3]. The design also demonstrates compatibility with commercial linear algebra accelerators, enabling efficient FHE deployment.
Keywords
Funding Information
- National Key R&D Program of China (2023YFB3106200)
- National Natural Science Foundation of China (62572020)
- National Natural Science Foundation of China (T2425023)
- National Natural Science Foundation of China (624B2016)
- National Natural Science Foundation of China (62202028)
- National Natural Science Foundation of China (62172025)
- National Natural Science Foundation of China (U2241213)
This publication has 32 references indexed in Scilit:
- Better Bootstrapping for Approximate Homomorphic Encryption2020
- A Full RNS Variant of Approximate Homomorphic Encryption2019
- Homomorphic Lower Digits Removal and Improved FHE Bootstrapping2018
- Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes2017
- Homomorphic Encryption for Arithmetic of Approximate Numbers2017
- A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes2017
- Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography2016
- cuHE: A Homomorphic Encryption Accelerator Library2016
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP2012
- A fast recursive algorithm for the discrete sine transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1990