Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes

DOI10.1007/978-3-319-72565-9_8zbMath1384.94029OpenAlexW2747115049MaRDI QIDQ1746962

Xianqiang Yang

Publication date: 26 April 2018

Full work available at URL: https://hal.sorbonne-universite.fr/hal-01585516/file/SAC17.pdf

zbMATH Keywords

polynomial reductionhomomorphic encryptionresidue number systemsnumber theoretic transformRing Learning With Errors

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the concrete hardness of learning with errors
• Variance-constrained actor-critic algorithms for discounted and average reward MDPs
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• Speeding up the number theoretic transform for faster ideal lattice-based cryptography
• Fully homomorphic SIMD operations
• NFLlib: NTT-Based Fast Lattice Library
• cuHE: A Homomorphic Encryption Accelerator Library
• (Leveled) fully homomorphic encryption without bootstrapping
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
• Algorithms in HElib
• Homomorphic Evaluation of the AES Circuit
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers
• Enhancing Data Parallelism of Fully Homomorphic Encryption
• Modular Multiplication Without Trial Division
• On Ideal Lattices and Learning with Errors over Rings
• A Toolkit for Ring-LWE Cryptography
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes