Lattice Reduction for Modular Knapsack
From MaRDI portal
Publication:3455505
DOI10.1007/978-3-642-35999-6_18zbMATH Open1327.94068OpenAlexW1505360842MaRDI QIDQ3455505FDOQ3455505
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
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
Combinatorial optimization (90C27) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- BKZ 2.0: Better lattice security estimates
- Factoring polynomials with rational coefficients
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Predicting Lattice Reduction
- Solving low-density subset sum problems
- A more efficient algorithm for lattice basis reduction
- Floating-Point LLL Revisited
- Improved low-density subset sum algorithms
- On the equidistribution of Hecke points
- Fast LLL-type lattice reduction
- Gradual sub-lattice reduction and a new complexity for factoring polynomials
- Adapting Density Attacks to Low-Weight Knapsacks
Cited In (1)
Uses Software
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)
