Paper 2025/488

Exploring General Cyclotomic Rings in Torus-Based Fully Homomorphic Encryption

Philippe Chartier, French Institute for Research in Computer Science and Automation
Michel Koskas, Ravel Technologies
Mohammed Lemou, Centre National de la Recherche Scientifique
Abstract

In this article, we develop algebraic tools for fully homomorphic encryption over the torus in the setting of general composite cyclotomic indices. Working in cyclotomic rings and fields beyond the power-of-two case, we reframe and optimize key primitives—reduction modulo $\Phi_M$, homomorphic evaluation of trace operators, blind extraction and the blind rotation used in bootstrapping—using systematic duality and trace techniques. Our approach yields a simpler, more modular description of bootstrapping, including a new systematic treatment of so-called “nega-cyclicity” conditions and featuring an optimal reduction of the input noise, and provides sharp error bounds showing that bootstrap noise growth remains mild compared with the classical power-of-two instantiation. In addition, we introduce a new fast packing strategy. These results broaden the algebraic toolkit for torus-based FHE and pave the way for new cryptographic constructions and applications.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
Keywords
fully homomorphic encryptionresidue number systemtrace operatorextractionbootstrapping
Contact author(s)
philippe chartier @ inria fr
michel koskas @ raveltech io
mohammed lemou @ univ-rennes fr
History
2025-10-09: last of 3 revisions
2025-03-14: received
See all versions
Short URL
https://ia.cr/2025/488
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/488,
      author = {Philippe Chartier and Michel Koskas and Mohammed Lemou},
      title = {Exploring General Cyclotomic Rings in Torus-Based Fully Homomorphic Encryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/488},
      year = {2025},
      url = {https://eprint.iacr.org/2025/488}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.