A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram–Schmidt lengths

Masaya Yasuda, Junpei Yamaguchi

研究成果: Contribution to journalArticle査読

3 被引用数 (Scopus)

抄録

Lattice basis reduction algorithms have been used in cryptanalysis. The most famous algorithm is LLL, proposed by Lenstra, Lenstra, Lovász, and one of its typical improvements is LLL with deep insertions (DeepLLL). A DeepLLL-reduced basis is LLL-reduced, and hence its quality is at least as good as LLL. In practice, DeepLLL often outputs a more reduced basis than LLL, but no theoretical result is known. First, we show provable output quality of DeepLLL, strictly better than that of LLL. Second, as a main work of this paper, we propose a new variant of DeepLLL. The squared-sum of Gram–Schmidt lengths of a basis is related with the computational hardness of lattice problems such as the shortest vector problem (SVP). Given an input basis, our variant monotonically decreases the squared-sum by a given factor at every deep insertion. This guarantees that our variant runs in polynomial-time.

本文言語英語
ページ(範囲)2489-2505
ページ数17
ジャーナルDesigns, Codes, and Cryptography
87
11
DOI
出版ステータス出版済み - 11 1 2019

All Science Journal Classification (ASJC) codes

  • コンピュータ サイエンスの応用
  • 応用数学

フィンガープリント

「A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram–Schmidt lengths」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル