Impact of the modulus switching technique on some attacks against learning problems

Huy Quoc Le, Pradeep Kumar Mishra, Satoshi Nakamura, Koha Kinjo, Dung Hoang Duong, Masaya Yasuda

研究成果: Contribution to journalArticle査読

1 被引用数 (Scopus)

抄録

The modulus switching technique has been used in some cryptographic applications as well as in cryptanalysis. For cryptanalysis against the learning with errors (LWE) problem and the learning with rounding (LWR) problem, it seems that one does not know whether the technique is really useful or not. This work supplies a complete view of the impact of this technique on the decoding attack, the dual attack and the primal attack against both LWE and LWR. For each attack, the authors give the optimal formula for the switching modulus. The formulas get involved the number of LWE/LWR samples, which differs from the known formula in the literature. They also attain the corresponding sufficient conditions saying when one should utilise the technique. Surprisingly, restricted to the LWE/LWR problem that the secret vector is much shorter than the error vector, they also show that performing the modulus switching before using the so-called rescaling technique in the dual attack and the primal attack make these attacks worse than only exploiting the rescaling technique as reported by Bai and Galbraith at the Australasian conference on information security and privacy (ACISP) 2014 conference. As an application, they theoretically assess the influence of the modulus switching on the LWE/LWR-based second round NIST PQC submissions.

本文言語英語
ページ(範囲)286-303
ページ数18
ジャーナルIET Information Security
14
3
DOI
出版ステータス出版済み - 5 1 2020
外部発表はい

All Science Journal Classification (ASJC) codes

  • ソフトウェア
  • 情報システム
  • コンピュータ ネットワークおよび通信

フィンガープリント

「Impact of the modulus switching technique on some attacks against learning problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル