A refined analysis of the cost for solving LWE via uSVP

DOI10.1007/978-3-030-23696-0_10zbMath1454.94045OpenAlexW2954009938MaRDI QIDQ2177627

Shaun Miller, Weiqiang Wen, Shi Bai

Publication date: 6 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-23696-0_10

zbMATH Keywords

LWElattice-based cryptographylattice reductionuSVP

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

A trace map attack against special ring-LWE samples ⋮ Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem ⋮ Solving the search-LWE problem over projected lattices ⋮ Revisiting lower dimension lattice attacks on NTRU ⋮ On the success probability of solving unique SVP via BKZ ⋮ LWE with side information: attacks and concrete security estimation

This page was built for publication: A refined analysis of the cost for solving LWE via uSVP