Solving LWR via BDD strategy: Modulus switching approach

Huy Quoc Le, Pradeep Kumar Mishra, Dung Hoang Duong, Masaya Yasuda

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 引用 (Scopus)

抜粋

The typical approach in attacking an LWR m,n,q,p(χs) instance parameterized by four integers m, n, q, p (Formula Presented) and a probability distribution χs is just by simply regarding it as a Learning with Errors (LWE) modulo q instance and then trying to adapt known LWE attacks to this LWE instance. In this paper, we show that for an LWR m,n,q,p(χs) instance whose parameters satisfy a certain sufficient condition, one can use the BDD strategy to recover the secret with higher advantages if one transforms the LWR instance to an LWE modulo (Formula Presented) instance with (Formula Presented) chosen appropriately instead of an LWE modulo q instance. The optimal modulus q used in our BDD attack is quite close to p as well as typically smaller than q. Especially, our experiments confirm that our BDD attack is much better in solving search-LWR in terms of root Hermite factor, success probability and even running time either in case the ratio log (q)/log (p) is big or/and the dimension n is sufficiently large.

元の言語英語
ホスト出版物のタイトルCryptology and Network Security - 17th International Conference, CANS 2018, Proceedings
編集者Panos Papadimitratos, Jan Camenisch
出版者Springer Verlag
ページ357-376
ページ数20
ISBN(印刷物)9783030004330
DOI
出版物ステータス出版済み - 1 1 2018
イベント17th International Conference on Cryptology and Network Security, CANS 2018 - Naples, イタリア
継続期間: 9 30 201810 3 2018

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
11124 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他17th International Conference on Cryptology and Network Security, CANS 2018
イタリア
Naples
期間9/30/1810/3/18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Solving LWR via BDD strategy: Modulus switching approach' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Le, H. Q., Mishra, P. K., Duong, D. H., & Yasuda, M. (2018). Solving LWR via BDD strategy: Modulus switching approach. : P. Papadimitratos, & J. Camenisch (版), Cryptology and Network Security - 17th International Conference, CANS 2018, Proceedings (pp. 357-376). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 11124 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-00434-7_18