We study efficient non-arithmetic operations in (G)BFV with arbitrary plaintext modulus. We design scheme conversions between (G)BFV and Discrete CKKS, allowing (G)BFV ciphertexts to use radix-based integer computation in the Discrete CKKS setting. This gives asymptotically faster logical operations: for plaintext modulus $p$, homomorphic comparison runs in $O(\log p \log\log p)$ for BFV and $O(\log\log p)$ for GBFV.
BibTeX
@misc{cryptoeprint:2026/732,
author = {Jaehyung Kim},
title = {Faster Logical Operations from Discrete {CKKS}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/732},
year = {2026},
url = {https://eprint.iacr.org/2026/732}
}
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。