Lower bounds on lattice enumeration with extreme pruning

DOI10.1007/978-3-319-96881-0_21zbMath1436.94032OpenAlexW2884836825MaRDI QIDQ1784109

Phong Q. Nguyen, Junji Shikata, Yoshinori Aono, Takenobu Seito

Publication date: 26 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96881-0_21

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Lower bounds on lattice sieving and information set decoding ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge

Uses Software

• fpLLL

This page was built for publication: Lower bounds on lattice enumeration with extreme pruning