LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
From MaRDI portal
(Redirected from Publication:498985)
Recommendations
Cites work
- scientific article; zbMATH DE number 3980484 (Why is no real title available?)
- scientific article; zbMATH DE number 1852137 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Algorithmic Number Theory
- An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
- Asymptotically Efficient Lattice-Based Digital Signatures
- BKZ 2.0: Better lattice security estimates
- Breaking fully-homomorphic-encryption challenges. (Abstract)
- Computing arbitrary functions of encrypted data
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Factoring polynomials with rational coefficients
- Fast LLL-type lattice reduction
- Faster fully homomorphic encryption
- Floating-Point LLL Revisited
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- H-LLL: using Householder inside LLL
- Implementing Gentry's fully-homomorphic encryption scheme
- Lattice Reduction for Modular Knapsack
- On the equidistribution of Hecke points
- Predicting Lattice Reduction
- Ring switching in BGV-style homomorphic encryption
- The LLL algorithm. Survey and applications
- The Magma algebra system. I: The user language
Cited in
(5)- Towards faster polynomial-time lattice reduction
- On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)
- Fast practical lattice reduction through iterated compression
- An efficient lattice reduction using reuse technique blockwisely on NTRU
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
This page was built for publication: LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498985)
