On the shortness of vectors to be found by the Ideal-SVP quantum algorithm
The hardness of finding short vectors in ideals of cyclotomic number fields (hereafter, Ideal-SVP) can serve as a worst-case assumption for numerous efficient cryptosystems, via the average-case problems Ring-SIS and Ring-LWE. For a while, it could be assumed the Ideal-SVP problem was as hard as the analog problem for general lattices (SVP), even when considering quantum algorithms.
But in the last few years, a series of works has lead to a quantum algorithm for Ideal-SVP that outperforms what can be done for general SVP in certain regimes. More precisely, it was demonstrated (under certain hypotheses) that one can find in quantum polynomial time a vector longer by a factor at most than the shortest non-zero vector in a cyclotomic ideal lattice, where n is the dimension.
In this work, we explore the constants hidden behind this asymptotic claim. While these algorithms have quantum steps, the steps that impact the approximation factor α are entirely classical, which allows us to estimate it experimentally using only classical computing. Moreover, we design heuristic improvements for those steps that significantly decrease the hidden factors in practice. Finally, we derive new provable effective lower bounds based on volumetric arguments.
This study allows to predict the crossover point with classical lattice reduction algorithms, and thereby determine the relevance of this quantum algorithm in any cryptanalytic context. For example we predict that this quantum algorithm provides shorter vectors than BKZ-300 (roughly the weakest security level of NIST lattice-based candidates) for cyclotomic rings of rank larger than about 24000.
|Quantum cryptanalysis, Cyclotomic ideal lattices|
|Lecture Notes in Computer Science , Security and Cryptology|
|Annual International Cryptology Conference|
Ducas, L, Plancon, M.C.G, & Wesolowski, B.P.C. (2019). On the shortness of vectors to be found by the Ideal-SVP quantum algorithm. In Advances in Cryptology - CRYPTO 2019 (pp. 322–351). doi:10.1007/978-3-030-26948-7_12