Metraipolis › archive › dc_0cb547ed0ca9
End-to-End NTT on FPGA for FHE Acceleration — arXiv:2611.03325
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03325
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:13:38.151Z
- SHA-256 of the archived text
15d09817d5940caa91769459aeb6205a923976a40a3ed7691bd60f3d5f8fe204- Stable URL of this page
https://metraipolis.com/documento/dc_0cb547ed0ca9
How to cite
End-to-End NTT on FPGA for FHE Acceleration — arXiv:2611.03325 — arXiv (en), https://arxiv.org/abs/2611.03325 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0cb547ed0ca9 (Metraipolis archive dc_0cb547ed0ca9, sha256 15d09817d5940caa91769459aeb6205a923976a40a3ed7691bd60f3d5f8fe204)
BibTeX
@misc{dc0cb547ed0ca9,
title = {End-to-End NTT on FPGA for FHE Acceleration — arXiv:2611.03325},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03325},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0cb547ed0ca9; sha256 15d09817d5940caa91769459aeb6205a923976a40a3ed7691bd60f3d5f8fe204},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03325. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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.
Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.AR, nuovi lavori del giorno).
Categorie arXiv: Cryptography and Security (cs.CR) ; Hardware Architecture (cs.AR).
Pagina del lavoro: https://arxiv.org/abs/2611.03325 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:00:22.183Z dalla pagina https://arxiv.org/list/cs.AR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).