Lattice Reduction for Modular Knapsack

DOI10.1007/978-3-642-35999-6_18MaRDI QIDQ3455505zbMATH OpenOpenAlexFDO

Authors Thomas Plantard, Willy Susilo, Zhenfei Zhang

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 problemideal latticelattice theorylattice reductionLLLrecursive reduction

Mathematics Subject Classification ID

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

Recommendations

• LLL-reduction for integer knapsacks
• Lattice Reduction Algorithms: Theory and Practice
• A deterministic algorithm for modular knapsack problems
• Recursive lattice reduction
• scientific article; zbMATH DE number 1276813
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Towards faster polynomial-time lattice reduction
• scientific article; zbMATH DE number 1973871
• Lattice reduction using a Euclidean algorithm

Cites work

• A more efficient algorithm for lattice basis reduction
• Adapting Density Attacks to Low-Weight Knapsacks
• BKZ 2.0: Better lattice security estimates
• Factoring polynomials with rational coefficients
• Fast LLL-type lattice reduction
• Floating-Point LLL Revisited
• Fully homomorphic encryption with relatively small key and ciphertext sizes
• Improved low-density subset sum algorithms
• On the equidistribution of Hecke points
• Predicting Lattice Reduction
• Solving low-density subset sum problems

Cited in

(1)

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

Describes a project that uses

Uses Software

• BKZ
• fpLLL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455505)