CRT representation of LWE based TFHE

DOI10.1007/S40314-025-03190-2MaRDI QIDQ6990046zbMATH OpenFDO

Authors Mehmet Özen, Serra Sazoğlu, Ünal Çavuşoğlu, Abdullah Sevin

Publication date 29 April 2025

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S40314-025-03190-2

zbMATH Keywords

Chinese remainder theorem (CRT)homomorphic encryptiontorus fully homomorphic encryption (TFHE)

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A full RNS variant of approximate homomorphic encryption
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• An improved RNS variant of the BFV homomorphic encryption scheme
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully homomophic encryption over the integers revisited
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic evaluation of the AES circuit
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• On ideal lattices and learning with errors over rings
• TFHE: fast fully homomorphic encryption over the torus

This page was built for publication: CRT representation of LWE based TFHE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6990046)