Improved lattice enumeration algorithms by primal and dual reordering methods
From MaRDI portal
Publication:2104429
Recommendations
- Lattice enumeration using extreme pruning
- Lower bounds on lattice enumeration with extreme pruning
- An improved partial enumeration algorithm for integer programming problems
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Primal-dual methods for vertex and facet enumeration
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- An algorithm for finding optimal integration lattices of composite order
- Search for combinatorial objects using lattice algorithms -- revisited
Cites work
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 503248 (Why is no real title available?)
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- A sieve algorithm for the shortest lattice vector problem
- BKZ 2.0: Better lattice security estimates
- Finding short lattice vectors within Mordell's inequality
- Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
- Improving the BKZ reduction algorithm by quick reordering technique
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice enumeration using extreme pruning
- On lattices, learning with errors, random linear codes, and cryptography
- Practical, Predictable Lattice Basis Reduction
This page was built for publication: Improved lattice enumeration algorithms by primal and dual reordering methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104429)