Lattice Reduction for Modular Knapsack

DOI10.1007/978-3-642-35999-6_18zbMath1327.94068OpenAlexW1505360842MaRDI QIDQ3455505

Thomas Plantard, Zhenfei Zhang, Willy Susilo

Publication date: 4 December 2015

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://ro.uow.edu.au/eispapers/2543

zbMATH Keywords

knapsack problemlattice theoryideal latticelattice reductionLLLrecursive reduction

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

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

Uses Software

• BKZ
• fpLLL

Cites Work

• Factoring polynomials with rational coefficients
• Improved low-density subset sum algorithms
• Gradual sub-lattice reduction and a new complexity for factoring polynomials
• Fast LLL-type lattice reduction
• BKZ 2.0: Better Lattice Security Estimates
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Solving low-density subset sum problems
• A more efficient algorithm for lattice basis reduction
• On the equidistribution of Hecke points
• Floating-Point LLL Revisited
• Adapting Density Attacks to Low-Weight Knapsacks
• Predicting Lattice Reduction

This page was built for publication: Lattice Reduction for Modular Knapsack