Paper 2023/783
Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings
Abstract
The Brakerski-Gentry-Vaikuntanathan (BGV) scheme is a Fully Homomorphic Encryption (FHE) cryptosystem based on the Ring Learning With Error (RLWE) problem.
Ciphertexts in this scheme contain an error term that grows with operations and causes decryption failure when it surpasses a certain threshold.
For this reason, the parameters of BGV need to be estimated carefully, with a trade-off between security and error margin.
The ciphertext space of BGV is the ring
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Designs, Codes and Cryptography, 2024
- DOI
- 10.1007/s10623-024-01524-5
- Keywords
- Fully Homomorphic EncryptionBGVnon-power-of-twoparameter estimation
- Contact author(s)
-
andreadigiusto7 @ gmail com
chiara marcolla @ tii ae - History
- 2024-12-05: last of 4 revisions
- 2023-05-29: received
- See all versions
- Short URL
- https://ia.cr/2023/783
- License
-
CC BY-NC-SA
BibTeX
@misc{cryptoeprint:2023/783, author = {Andrea Di Giusto and Chiara Marcolla}, title = {Breaking the power-of-two barrier: noise estimation for {BGV} in {NTT}-friendly rings}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/783}, year = {2023}, doi = {10.1007/s10623-024-01524-5}, url = {https://eprint.iacr.org/2023/783} }