LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme

DOI10.1007/s10623-014-9957-1zbMath1360.11144OpenAlexW2049120054MaRDI QIDQ498985

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

zbMATH Keywords

lattice theoryideal latticefully homomorphic encryptionlattice reductionLLL

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (3)

An efficient lattice reduction using reuse technique blockwisely on NTRU ⋮ Fast practical lattice reduction through iterated compression ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices

Uses Software

• Magma
• BKZ
• fhe

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The LLL algorithm. Survey and applications
• Factoring polynomials with rational coefficients
• The Magma algebra system. I: The user language
• Gradual sub-lattice reduction and a new complexity for factoring polynomials
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Fast LLL-type lattice reduction
• (Leveled) fully homomorphic encryption without bootstrapping
• H-LLL
• Fully Homomorphic Encryption with Polylog Overhead
• Breaking Fully-Homomorphic-Encryption Challenges
• Ring Switching in BGV-Style Homomorphic Encryption
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Faster Fully Homomorphic Encryption
• BKZ 2.0: Better Lattice Security Estimates
• Lattice Reduction for Modular Knapsack
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Fully Homomorphic Encryption over the Integers
• Computing arbitrary functions of encrypted data
• On the equidistribution of Hecke points
• A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Floating-Point LLL Revisited
• An LLL-reduction algorithm with quasi-linear time complexity
• Asymptotically Efficient Lattice-Based Digital Signatures
• Predicting Lattice Reduction
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Algorithmic Number Theory

This page was built for publication: LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme