Skip to content

Faster Logical Operations from Discrete CKKS

Year: 2026

type: technique collection: schemes status: auto

Links: ePrint 2026/732

Summary

Auto-extracted summary (unreviewed)

Jaehyung Kim designs scheme conversions between (G)BFV and Discrete CKKS so that BFV ciphertexts with an arbitrary (including large prime) plaintext modulus can be evaluated with radix-based integer computation in the Discrete CKKS setting, giving a reusable backend for non-arithmetic operations such as comparison and bit-wise computation. The resulting homomorphic comparison costs O(log p log log p) for BFV and O(log log p) for GBFV, asymptotically faster than polynomial-interpolation approaches.

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.
Source: pdf

Extracted details

Field Value Source Confidence
contribution scheme conversion between (G)BFV and Discrete CKKS llm 0.70
contribution non-arithmetic operations for BFV with arbitrary plaintext modulus via radix-based integer computation llm 0.70
contribution homomorphic comparison in O(log p log log p) for BFV and O(log log p) for GBFV llm 0.70
schemes BFV llm 0.70
schemes GBFV llm 0.70
schemes Discrete CKKS llm 0.70
schemes CKKS llm 0.70
tasks homomorphic comparison llm 0.70
tasks bit-wise operations on encrypted integers llm 0.70
tasks scheme conversion llm 0.70
interaction non-interactive FHE llm 0.70
llm relevance low llm 0.70
key result asymptotic cost of homomorphic comparison: O(log p log log p) for BFV, O(log log p) for GBFV (plaintext modulus p) llm 0.70

Keyword mentions

Counts of vocabulary terms in the full text (first page of occurrence in brackets).

  • scheme: CKKS 169 [p.1], BFV 105 [p.1], BGV 9 [p.1], PIR 3 [p.1], TFHE 2 [p.1], Scheme switching 2 [p.5]
  • library: MP-SPDZ 1 [p.1]
  • technique: Bootstrapping 65 [p.2], Functional bootstrapping 14 [p.2], Lookup table 10 [p.2], SIMD packing 9 [p.1], Modulus switching 4 [p.6], Rotations 2 [p.8], NTT 2 [p.1]
  • assumption: LWE 15 [p.4], RLWE 11 [p.2], Lattice-based 2 [p.27]
  • topic: Homomorphic encryption 23 [p.1]

Files

Path (under papers/) Collection Pages Size SHA-256 Note
references/schemes/s10-2_eprint-2026-732.pdf schemes 28 551.5 KB b832fed79dc5

Database key: faster-logical-operations-from-discrete-ckks · created 2026-11-05 · updated 2026-11-05 · edit with python3 tools/paperdb.py set faster-logical-operations-from-discrete-ckks COLUMN VALUE