Paper 2026/1783

Compiling Sparse Keys for Bootstrapping FHEs: Algorithms, Hardware Acceleration, and Beyond

Binwu Xiang, East China Normal University
Songyu Wu, Institute of Information Engineering, Chinese Academy of Sciences
Baoyu Li, Shanghai Jiao Tong University
Xinwei Qiang, Shanghai Jiao Tong University
Benqiang Wei, China Telecom Quantum Information Technology Group Co.
Yu Yu, Shanghai Jiao Tong University
Abstract

Blind rotation is the dominant computational bottleneck in bootstrapping for bitwise FHE schemes such as TFHE. Existing constructions typically evaluate $O(n)$ sequential external products for an LWE secret of dimension $n$, incurring substantial latency and a large number of NTT/iNTT operations. In this work, we present a new framework for NTRU-based bootstrapping that reduces the sequential complexity of blind rotation for sparse binary LWE secrets. Inspired by Jain et al. (CRYPTO 2026), we use Cuckoo hashing to transform an $n$-dimensional binary LWE secret of Hamming weight $h$ into extended buckets of one-hot representation. This structured representation reduces the sequential external products from $O(n)$ to $O(h)$ in blind rotation. We also design a modulus-switching method tailored to sparse secrets. We further explore an NTT-free variant that eliminates all online NTT/iNTT operations during blind rotation while supporting gate bootstrapping with lower parallel depth, offering a potentially useful building block for hardware-friendly FHE implementations. Empirically, we achieve state-of-the-art bootstrapping performance on both CPUs and GPUs. At comparable decryption failure rates and on a single CPU thread with AVX-512, our implementation executes Boolean gate, 4-bit, and 6-bit bootstrapping in $0.83$, $1.75$, and $2.65$\,ms, outperforming TFHE-rs by $3.31\times$, $4.18\times$, and $20.47\times$, respectively. On an RTX~4090 GPU, we attain a throughput of $154{,}739$ gate bootstraps per second, corresponding to an amortized time of $6.46\,\mu\mathrm{s}$, and speedups of $86.7\times$ over our CPU result and $13.6\times$ over VeloFHE (Shen et al., TCHES 2025). As a concrete application, we develop the first NTRU-based 8-bit FHE instruction set, achieving up to over $10\times$ speedup over Trama et al. (TCHES 2025) with over $100\times$ smaller key size.

Note: Updated the NSA application results.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
FHEGPUISA
Contact author(s)
bwxiang @ sc ecnu edu cn
wusongyu @ iie ac cn
yuyu @ yuyu hk
History
2026-08-24: last of 2 revisions
2026-08-23: received
See all versions
Short URL
https://ia.cr/2026/1783
License
No rights reserved
CC0

BibTeX

@misc{cryptoeprint:2026/1783,
      author = {Binwu Xiang and Songyu Wu and Baoyu Li and Xinwei Qiang and Benqiang Wei and Yu Yu},
      title = {Compiling Sparse Keys for Bootstrapping {FHEs}: Algorithms, Hardware Acceleration, and Beyond},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1783},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1783}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.