Enhancing data parallelism of fully homomorphic encryption
From MaRDI portal
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A comparison of the homomorphic encryption schemes FV and YASHE
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic evaluation of the AES circuit
- Introduction to algorithms
- NFLlib: NTT-Based Fast Lattice Library
- Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware
Cited in
(5)- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes
- Faster homomorphic encryption over GPGPUs via hierarchical DGT
- Field instruction multiple data
- Accelerating integer based fully homomorphic encryption using frequency domain multiplication
- Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM
This page was built for publication: Enhancing data parallelism of fully homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988346)