Skip to content

Fully Homomorphic Encryption on the Ring of Gaussian Periods

Year: 2026

type: technique collection: schemes status: auto

Links: ePrint 2026/927

Summary

Auto-extracted summary (unreviewed)

This paper generalizes the subring approach of GBFV by building BFV-style FHE on the decomposition ring of a cyclotomic field and further on its subrings (the ring of Gaussian periods), which lowers the working dimension from r to any suitable divisor n while keeping degree-1 slots for small plaintext primes rather than only large cyclotomic primes. New encoding and decoding maps are introduced for the decomposition subring, reducing the asymptotic cost of encryption, decryption, addition and multiplication. A SageMath proof-of-concept shows up to a 5.06x latency improvement and gives parameter sets with plaintext moduli as small as 17 at roughly 100-130-bit security.

Abstract

In Geelen and Vercauteren (Eurocrypt 2025), a Generalized BFV (GBFV) fully homomorphic encryption scheme was proposed. Here, a plaintext space of form Z[x]/(Φ(x), t(x)) was utilized to reduce the number of Single Instruction Multiple Data (SIMD) slots within the initial BFV plaintext space. This lowered its dimension and thus enabled lower latencies as well as greater flexibility in parameter selection. However, to obtain slots of degree 1, the methods of Geelen and Vercauteren limit the choice of plaintext modulus to that of large primes, which can be unnecessary for various use cases. To resolve this, we propose a generalized method to perform FHE based on a subring of the plaintext polynomial ring. We utilize the decomposition ring OK, with which when taking quotient with a rational prime p, already factors into residual fields of dimension 1. From here, we develop methods to perform FHE on subrings of the decomposition ring OK, which we refer to as the decomposition subring OM. We introduce novel methods to enable both encoding and decoding maps within the decomposition subring OM ⊂OK. By utilizing OM, we further lower the dimension of the underlying ring, improving upon efficiency while retaining sufficient security. In experiments, we provide a proof-of-concept implementation, demonstrating up to a 5.06× improvement in the latency of operations for selected parameters. This approach offers enhanced flexibility in the selection of parameters for FHE with the subring dimension being any suitable divisor of r. This direction also represents the first generalization of the subring approach for FHE.
Source: pdf

Extracted details

Field Value Source Confidence
contribution FHE on the decomposition subring (ring of Gaussian periods) generalizing GBFV's subring approach llm 0.85
contribution Novel encoding and decoding maps within the decomposition subring llm 0.85
contribution Reduced complexity: encryption/decryption O(n log n), addition O(n), multiplication O(l_w n log n) instead of r-dimensional costs llm 0.85
contribution Flexible parameter selection with small plaintext primes and subring dimension any divisor of r llm 0.85
contribution Proof-of-concept implementation with six parameter sets and comparison to GBFV llm 0.85
schemes BFV llm 0.85
schemes GBFV llm 0.85
schemes RLWE llm 0.85
libraries SageMath llm 0.85
libraries Lattice Estimator llm 0.85
tasks SIMD FHE arithmetic over small prime plaintext moduli llm 0.85
hardware Intel Core i7-7700HQ CPU at 2.80 GHz llm 0.85
security level approximately 128-bit for parameter sets 1, 3 and 5; at least 80-bit for all sets (Lattice Estimator) llm 0.85
interaction non-interactive FHE llm 0.85
limitations Only a proof-of-concept SageMath implementation; parameter sizes were limited by the available hardware llm 0.85
limitations Supported multiplicative depth (<4 to <6 levels) is far below GBFV's roughly 25 levels llm 0.85
limitations No direct comparison with the parameter sets of prior decomposition-ring works since applying the technique to them would give insufficient security llm 0.85
limitations Bootstrapping on the subring is left to future work llm 0.85
llm relevance low llm 0.85
key result latency improvement: up to 5.06x (parameter set 2 (dimension 5220 reduced to 1044), encryption) llm 0.85
key result multiplication time: 414 ms vs 1983 ms (parameter set 2-B vs 2-A, SageMath on i7-7700HQ) llm 0.85
key result smallest plaintext modulus: 17 with 1044 slots at 103.4-bit security (vs 2^16+1 required by GBFV for similar slot count) llm 0.85
key result multiplication levels: fewer than 4-6 (vs about 25 for GBFV parameters at similar slots and security) llm 0.85

Keyword mentions

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

  • scheme: BFV 34 [p.1], BGV 4 [p.2], RSA 3 [p.25], CKKS 2 [p.2], TFHE 2 [p.2], FHEW 2 [p.2]
  • model: Mixture of experts 1 [p.25]
  • technique: Bootstrapping 11 [p.3], SIMD packing 6 [p.1], Relinearization 4 [p.20], Rotations 3 [p.3]
  • assumption: LWE 19 [p.4], RLWE 16 [p.4], Lattice-based 4 [p.7]
  • task: Language modeling / generation 34 [p.1]
  • topic: Homomorphic encryption 50 [p.1], Benchmark 2 [p.21]

Files

Path (under papers/) Collection Pages Size SHA-256 Note
references/schemes/s17-2_eprint-2026-927.pdf schemes 29 665.8 KB 3fc06d97b726

Database key: fully-homomorphic-encryption-on-the-ring-of-gaussian-periods · created 2026-11-05 · updated 2026-11-05 · edit with python3 tools/paperdb.py set fully-homomorphic-encryption-on-the-ring-of-gaussian-periods COLUMN VALUE