Home | Resources | Meetups | Conference 2025 | Join the community
Simpler and Faster BFV Bootstrapping for Arbitrary Plaintext Modulus from CKKS
by Jinyeong Seo - 2024.02.29
Presentation recording (Youtube) | Speaker interview (Youtube) | Slides (Github) | Join the discussion (Discord)
Abstract
Bootstrapping is a key operation in fully homomorphic encryption schemes that enables the evaluation of arbitrary multiplicative depth circuits.
The conventional instantiation of BFV bootstrapping is accomplished through the digit extraction procedure. However, its efficiency is highly reliant on the plaintext modulus, limiting its use to a specific form—a power of a small prime number.
This presentation introduces a novel approach to instantiate BFV bootstrapping, distinct from the previous digit extraction-based method. The core idea is to leverage CKKS bootstrapping as a subroutine, shifting the performance focus to the underlying CKKS bootstrapping rather than the plaintext modulus.
When executing the bootstrapping operation for a 51-bit plaintext modulus, the proposed method improves upon the previous digit extraction-based method by a factor of 37.9 in latency and 29.4 in throughput. Furthermore, it achieves viable bootstrapping performance for larger plaintext moduli, such as 144-bits and 234-bits, which has not been measured before.
About the speaker
Jinyeong Seo is a Ph.D. student at Seoul National University, advised by Prof. Yongsoo Song.
His research interests lie in, but are not limited to, the practical instantiation of cryptographic protocols using techniques from lattice-based cryptography.
His recent research focuses on improving the performance of lattice-based proof systems and homomorphic encryption schemes.
Never miss an update
The newsletter where we post community announcements: https://fheorg.substack.com/
The discord server where you can discuss FHE related topics with the community: https://discord.fhe.org
Make sure to join either (or both) of these to stay informed about future events!