Faster Logical Operations from Discrete CKKS

Jaehyung Kim

Paper 2026/732

Faster Logical Operations from Discrete CKKS

Jaehyung Kim

, Stanford University

Abstract

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
Keywords: GBFV BFV Discrete CKKS Logical Operations
Contact author(s): jaehk @ cs stanford edu
History: 2026-04-19: approved; 2026-04-14: received; See all versions
Short URL: https://ia.cr/2026/732
License: CC BY

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}
}