On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm
On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm
复制标题
论理想-SVP量子算法求向量的短缺性
DOI：
10.1007/978-3-030-26948-7_12
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
B. Wesolowski
中科院分区：
文献类型：
--
作者：
L. Ducas;Maxime Plançon;B. Wesolowski
通过平均案例问题ring-sis和ring-lwe，在环形数字场理想中找到短量矢量的硬度（以下简称Ideal-SVP）可以作为众多有效的加密系统的最坏假设。有一段时间，即使考虑使用量子算法，也可以假设理想SVP问题与通用晶格（SVP）的模拟问题一样困难。
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.