FPT: A Fixed-Point Accelerator for Torus Fully Homomorphic Encryption
Michiel Van Beirendonck, Jan-Pieter D'Anvers, Furkan Turan, Ingrid Verbauwhede
Abstract
Fully Homomorphic Encryption (FHE) is a technique that allows computation on encrypted data. It has the potential to drastically change privacy considerations in the cloud, but high computational and memory overheads are preventing its broad adoption. TFHE is a promising Torus-based FHE scheme that heavily relies on bootstrapping, the noise-removal tool invoked after each encrypted logical/arithmetical operation. We present FPT, a Fixed-Point FPGA accelerator for TFHE bootstrapping. FPT is the first hardware accelerator to heavily exploit the inherent noise present in FHE calculations. Instead of double or single-precision floating-point arithmetic, it implements TFHE bootstrapping entirely with approximate fixed-point arithmetic. Using an in-depth analysis of noise propagation in bootstrapping FFT computations, FPT is able to use noise-trimmed fixed-point representations that are up to 50% smaller than prior implementations that prefer floating-point or integer FFTs. FPT is built as a streaming processor inspired by traditional streaming DSPs: it instantiates directly cascaded high-throughput computational stages, with minimal control logic and routing networks. We explore different throughput-balanced compositions of streaming kernels with a user-configurable streaming width in order to construct a full bootstrapping pipeline. Our proposed approach allows 100% utilization of arithmetic units and requires only a small bootstrapping key cache, enabling an entirely computebound bootstrapping throughput of 1 BS / 35𝜇s. This is in stark contrast to the established classical CPU approach to FHE bootstrapping acceleration, which is typically constrained by memory and bandwidth. FPT is fully implemented and evaluated as a bootstrapping FPGA kernel for an Alveo U280 datacenter accelerator card. FPT achieves two to three orders of magnitude higher bootstrapping throughput than existing CPU-based implementations, and 2.5× higher throughput compared to recent ASIC emulation experiments. CCS CONCEPTS • Security and privacy → Cryptography; • Hardware → Very large scale integration design; • Computer systems organization → Architectures. Client Cloud 𝐸𝑛𝑐 ( 𝒙 ) 𝐸𝑛𝑐 ( 𝒇 (𝒙 ) ) FPT: FPGA Acceleration Figure 1: In FHE applications, critical computations occur on a cloud server over encrypted data. The server cannot decrypt the data, ensuring its privacy during computation. Decryption is solely possible by the client. Despite being slow, FHE enables previously impossible applications, at least impossible with the same level of security. FPT -our proposed FPGA accelerator for cloud servers-makes FHE practical by boosting computation speed.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 08d764e1-8083-43a7-8d58-95a39b3ba243Cited by top-tier papers4
- Trinity: A General Purpose FHE AcceleratorXianglong Deng, Shengyu Fan, Zhicheng Hu, Zhuoyu Tian et al.MICRO 2024 · 34 citations
- Crypto Dark Matter on the Torus - Oblivious PRFs from Shallow PRFs and TFHEMartin R. Albrecht, Alex Davidson, Amit Deo, Daniel GardhamEUROCRYPT 2024 · 27 citations
- NSHEDB: Noise-Sensitive Homomorphic Encrypted Database Query EngineBoram Jung, Hung-Wei Tseng, Yuliang LiSIGMOD 2026 · 2 citations
- Leuvenshtein: Efficient FHE-based Edit Distance Computation with Single Bootstrap per CellWouter Legiest, Jan-Pieter D'Anvers, Bojan Spasic, Nam-Luc Tran et al.USENIX Security 2025
Builds on7
- F1: A Fast and Programmable Accelerator for Fully Homomorphic EncryptionNikola Samardzic, Axel Feldmann, Aleksandar Krastev, Srinivas Devadas et al.MICRO 2021 · 294 citations
- HEAX: An Architecture for Computing on Encrypted DataM. Sadegh Riazi, Kim Laine, Blake Pelton, Wei DaiASPLOS 2020 · 244 citations
- CraterLake: a hardware accelerator for efficient unbounded computation on encrypted dataNikola Samardzic, Axel Feldmann, Aleksandar Krastev, Nathan Manohar et al.ISCA 2022 · 205 citations
- BTS: an accelerator for bootstrappable fully homomorphic encryptionSangpyo Kim, Jongmin Kim, Michael Jaemin Kim, Wonkyung Jung et al.ISCA 2022 · 184 citations
- ARK: Fully Homomorphic Encryption Accelerator with Runtime Data Generation and Inter-Operation Key ReuseJongmin Kim, Gwangho Lee, Sangpyo Kim, Gina Sohn et al.MICRO 2022 · 160 citations
Related papers
- FAB: An FPGA-based Accelerator for Bootstrappable Fully Homomorphic EncryptionRashmi Agrawal, Leo de Castro, Guowei Yang, Chiraag Juvekar et al.HPCA 2023 · 136 citations
- Strix: An End-to-End Streaming Architecture with Two-Level Ciphertext Batching for Fully Homomorphic Encryption with Programmable BootstrappingAdiwena Putra, Prasetiyo, Yi Chen, John Kim et al.MICRO 2023 · 27 citations
- Maverick: Rethinking TFHE Bootstrapping on GPUs via Algorithm-Hardware Co-DesignZhiwei Wang, Haoqi He, Lutan Zhao, Qingyun Niu et al.ASPLOS 2026
- FlashTFHE: A Scalable Architecture for Efficient Multi-Bit Fully Homomorphic EncryptionJiaao Ma, Ceyu Xu, Ning Liang, Lisa Wu WillsISCA 2026
- Morphling: A Throughput-Maximized TFHE-based Accelerator using Transform-domain ReusePrasetiyo, Adiwena Putra, Joo-Young KimHPCA 2024 · 22 citations
