International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 11 September 2019

Divesh Aggarwal, Bogdan Ursu, Serge Vaudenay
ePrint Report ePrint Report
Abstract. There is a large gap between theory and practice in the complexities of sieving algorithms for solving the shortest vector problem in an arbitrary Euclidean lattice. In this paper, we work towards reducing this gap, providing theoretical refinements of the time and space complexity bounds in the context of the approximate shortest vector problem. This is achieved by relaxing the requirements on the AKS algorithm, rather than on the ListSieve, resulting in exponentially smaller bounds starting from $\mu\approx 2$, for constant values of $\mu$. We also explain why these improvements carry over to also give the fastest quantum algorithms for the approximate shortest vector problem.
Expand

Additional news items may be found on the IACR news page.