Fully Homomorphic Encryption (FHE) on large integers (Mohammed Lemou, CNRS/IRMAR, Rennes)

24.01.2025 13:15

This presentation focuses on a protocol for homomorphic encryption of large integers that integrates the encoding of their moduli using the Chinese Remainder Theorem (CRT) along with a TFHE-like encryption scheme designed for small messages. Within the framework of fully homomorphic encryption on the torus, we explore various algebraic tools that are crucial for managing polynomials in power prime cyclotomic contexts, including procedures for packing, extraction, and bootstrapping.

Lieu

Bâtiment: Conseil Général 7-9

1-07 (unusual time and place!), Séminaire d'analyse numérique

entrée libre