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

DOI10.1007/S10623-014-9957-1zbMATH Open1360.11144OpenAlexW2049120054MaRDI QIDQ498985FDOQ498985

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

• Towards faster polynomial-time lattice reduction
• Fast LLL-type lattice reduction
• Faster fully homomorphic encryption
• Improved key generation algorithm for Gentry's fully homomorphic encryption scheme
• Faster LLL-type Reduction of Lattice Bases

zbMATH Keywords

fully homomorphic encryptionideal latticelattice theorylattice reductionLLL

Mathematics Subject Classification ID

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
• 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
• 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 (4)

• 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

Uses Software

• Magma
• BKZ
• fhe

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)