Skip to content
Preprint

End-to-End NTT on FPGA for FHE Acceleration

Nov 2026 · 0 citations · 60 references
Computer Science

TL;DR

A fully unrolled, delay-commutator streaming NTT/INTT kernel is designed, and it accelerates core FHE operations, such as key switching and bootstrapping, by 1.8-2.2x, and neural network inference by 1.8-2.1x.

Abstract

Fully homomorphic encryption (FHE) enables privacy-preserving computation on encrypted data without decryption. Despite its strong security guarantees, FHE incurs substantial computational and memory overhead. In FHE-based deep learning inference, on average 63% of the CPU time is spent on the number theoretic transform (NTT) and its inverse (INTT), which reduce the complexity of polynomial multiplication from $O(N^2)$ to $O(N \log N)$. Prior FPGA works follow two approaches: accelerating entire FHE schemes, which yields significant speedups but ties them to specific parameters and algorithms, or accelerating only the NTT, which applies across schemes, algorithms, and libraries. Most FPGA NTT designs require interconnects that grow with parallelism and utilize significant resources, which complicates routing on multi-die FPGAs. Additionally, to the best of our knowledge, end-to-end NTT acceleration within an FHE context has so far been left unexplored. We design a fully unrolled, delay-commutator streaming NTT/INTT kernel, and floorplan it across the three dies of an AMD Alveo V80. At 400 MHz, the kernel transforms a polynomial of $2^{16}$ coefficients every 5.12 $\mu$s, the highest throughput among FPGA designs at this size. Offloaded end to end, it is up to 22x faster than the CPU per transform. We integrate the kernel into the Lattigo FHE library and evaluate it end to end. With 128-bit secure parameters, it accelerates core FHE operations, such as key switching and bootstrapping, by 1.8-2.2x, and neural network inference by 1.8-2.1x.

View source

Similar papers

Preprint Oct 2026

Rosemary: Efficient and Adaptable In-Storage Acceleration for Fully Homomorphic Encryption

Fully Homomorphic Encryption (FHE) enables computation on encrypted data and is promising for privacy-preserving computing. However, FHE deployment remains constrained due to massive computational, memory, and data-movement overheads. Existing acceleration strategies often overlook the storage I/O bottleneck caused by...

Xuan Wang, Tian-Qi Zhang, G. de Micheli et al. · 0 citations
Open access Oct 2026

Beyond Microcontrollers: End-to-End Full Decryption Oracle Power Attacks of HQC on FPGAs

The National Institute of Standards and Technology recently selected Hamming Quasi-Cyclic (HQC) as a critical code-based alternative for post-quantum cryptography. Hardware architectures like FPGAs successfully mitigate the severe performance bottlenecks of HQC software deployments. However, their physical security rem...

Yan-Ning Ji, Hai-Yue Dong, Elena Dubrova et al. · 0 citations
Book Open access Nov 2026

Beyond Approximate Arithmetic: Efficient Homomorphic Computation with Discrete CKKS

Fully homomorphic encryption (FHE) allows computations to be performed directly on encrypted sensitive data without decrypting it. Modern FHE schemes expose different computational models. CKKS distinguishes itself by supporting approximate arithmetic on packed complex values. Despite its high throughput, the absence o...

Elias Suvanto · 0 citations
Book Open access Nov 2026

FHEMIST: A Maximum Independent Set Technique for Efficient Bootstrapping Reductions in FHE Evaluations

Fully Homomorphic Encryption (FHE) enables arbitrary computation over encrypted data but suffers from noise growth, which eventually causes ciphertexts to be undecryptable after a few computations. Bootstrapping mitigates this issue but incurs significant computational overhead. Torus-FHE (TFHE) scheme [JoC 2019] achie...

Animesh Singh, Ayantika Chatterjee, Anupam Chattopadhyay et al. · 0 citations
Open access Sep 2026

FHE-Lab: A Modular Framework for Customizable Fully Homomorphic Encryption Pipelines

Fully Homomorphic Encryption (FHE) enables computation on encrypted data without requiring decryption, making it a foundational tool for privacy-preserving computation in untrusted environments. Modern open-source FHE libraries such as OpenFHE and HEaaN support multiple schemes and highly optimized implementations, but...

Vattana Chan, Matías Mazzanti, Augusto Vega et al. · 0 citations
Review Open access Sep 2026

A survey on fully homomorphic encryption compilers

This paper systematically reviews existing FHE compilers, examining their techniques and effectiveness to explore the current state of the art and identify areas for future research.

Zhuo-Yu Tian, Sheng-Yu Fan, Xiang-Long Deng et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.