Paper 2022/1363 Original: eprint.iacr.org/2022/1363 ↗
Bootstrapping for BGV and BFV Revisited
Abstract
We unify the state-of-the-art bootstrapping algorithms for BGV and BFV in a single framework, and show that both schemes can be bootstrapped with identical complexity. This result corrects a claim by Chen and Han (Eurocrypt 2018) that BFV is more efficient to bootstrap than BGV. We also fix an error in their optimized procedure for power-of-two cyclotomics, which occurs for some parameter sets. Our analysis is simpler, yet more general than earlier work, in that it simultaneously covers both BGV and BFV. Furthermore, we also design and implement a high-level open source software library for bootstrapping in the Magma Computer Algebra System. It is the first library to support both BGV and BFV bootstrapping in full generality, with all recent techniques (including the above fixes) and trade-offs.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2023-11-18: last updated
- 2022-10-11: published
- Short URL
- https://ia.cr/2022/1363
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/1363,
author = {Robin Geelen and Frederik Vercauteren},
title = {Bootstrapping for BGV and BFV Revisited},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/1363},
year = {2022},
url = {https://eprint.iacr.org/2022/1363}
}