LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
From MaRDI portal
Publication:498985
DOI10.1007/S10623-014-9957-1zbMATH Open1360.11144OpenAlexW2049120054MaRDI QIDQ498985FDOQ498985
Authors: Thomas Plantard, Willy Susilo, Zhenfei Zhang 
Publication date: 29 September 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-9957-1
Recommendations
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- The Magma algebra system. I: The user language
- BKZ 2.0: Better lattice security estimates
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Fully homomorphic encryption with polylog overhead
- Ring switching in BGV-style homomorphic encryption
- Implementing Gentry's fully-homomorphic encryption scheme
- Faster fully homomorphic encryption
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption over the integers with shorter public keys
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Factoring polynomials with rational coefficients
- Title not available (Why is that?)
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Predicting Lattice Reduction
- Title not available (Why is that?)
- Asymptotically Efficient Lattice-Based Digital Signatures
- Floating-Point LLL Revisited
- The LLL algorithm. Survey and applications
- On the equidistribution of Hecke points
- An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
- Algorithmic Number Theory
- Fast LLL-type lattice reduction
- Computing arbitrary functions of encrypted data
- Gradual sub-lattice reduction and a new complexity for factoring polynomials
- H-LLL: using Householder inside LLL
- Breaking fully-homomorphic-encryption challenges. (Abstract)
- Lattice Reduction for Modular Knapsack
- Title not available (Why is that?)
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
Cited In (5)
- On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)
- Fast practical lattice reduction through iterated compression
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- An efficient lattice reduction using reuse technique blockwisely on NTRU
- Towards faster polynomial-time lattice reduction
Uses Software
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)
