Paper 2026/2119 Original: eprint.iacr.org/2026/2119 ↗

CKKS Bootstrapping in less than 10ms

Rending Ouyang
Jian Liu
Peimin Gao
Pan Xiao
Heng Zhang
Man Ho Au
Cong Zhang
Kui Ren
Chun Chen
Abstract

Bootstrapping enables deep homomorphic computation in CKKS by replenishing multiplicative levels. It remains one of the scheme's most expensive operations. HEAAN reports a bootstrapping latency of 6.97ms, substantially faster than other publicly documented alternatives. However, the algorithmic and implementation techniques underlying this result have not been disclosed, leaving it unclear how such performance is achieved. In this work, we present a fully specified CKKS bootstrapping construction that achieves performance comparable to that reported by HEAAN. Building on SHIP (presented in Eurocrypt 2025), we introduce several algorithmic innovations that reduce communication and computational overhead while enabling efficient parallel execution. Our implementation bootstraps a single complex-valued ciphertext in 8.2ms and achieves an amortized latency of 4.6ms per ciphertext for a batch of 64. These results demonstrate practical sub-10ms CKKS bootstrapping.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2026-09-20: last updated
2026-09-20: published
Short URL
https://ia.cr/2026/2119
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2026/2119,
      author = {Rending Ouyang and Jian Liu and Peimin Gao and Pan Xiao and Heng Zhang and Man Ho Au and Cong Zhang and Kui Ren and Chun Chen},
      title = {CKKS Bootstrapping in less than 10ms},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2119},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2119}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.