| 電子情報通信学会 研究会発表申込システム 講演論文 詳細 |
技報閲覧サービス [ログイン] 技報アーカイブ |
| トップに戻る | 前のページに戻る | [Japanese] / [English] |
| 講演抄録／キーワード | ||
| 講演名 | 2023-05-17 15:55 ［招待講演］An Efficient Strategy to Construct a Better Differential on Multiple-Branch-Based Designs: Application to Orthros (from CT-RSA 2023) ○Kazuma Taka・Kosei Sakamoto（Hyogo Univ.）・Tatsuya Ishikawa（WDB KOUGAKU Co.,Ltd.）・Takanori Isobe（Hyogo Univ.）  ISEC2023-12 |
|
| 抄録 | （和） | As low-latency designs tend to have a small number of rounds to decrease latency, the differential-type cryptanalysis can become a significant threat to them. In particular, since a multiple-branch-based design, such as {sf Orthros} can have the strong clustering effect on differential attacks due to its large internal state, it is crucial to investigate the impact of the clustering effect in such a design. In this paper, we present a new SAT-based automatic search method for evaluating the clustering effect in the multiple-branch-based design. By exploiting an inherent trait of multiple-branch-based designs, our method enables highly efficient evaluations of clustering effects on this-type designs. We apply our method to the low-latency PRF {sf Orthros}, and show a best differential distinguisher reaching up to 7 rounds of {sf Orthros} with $2^{116.806}$ time/data complexity and 9-round distinguisher for each underlying permutation which is 2 more rounds than known longest distinguishers. Besides, we update the designer's security bound for differential attacks based on the lower bounds for the number of active S-boxes, and obtain the optimal differential characteristic of {sf Orthros}, {sf Branch 1}, and {sf Branch 2} for the first time. Consequently, we improve the designer's security bound from 9/12/12 to 7/10/10 rounds for {sf Orthros}/{sf Branch 1}/{sf Branch 2} based on a single differential characteristic. |
| （英） | As low-latency designs tend to have a small number of rounds to decrease latency, the differential-type cryptanalysis can become a significant threat to them. In particular, since a multiple-branch-based design, such as {sf Orthros} can have the strong clustering effect on differential attacks due to its large internal state, it is crucial to investigate the impact of the clustering effect in such a design. In this paper, we present a new SAT-based automatic search method for evaluating the clustering effect in the multiple-branch-based design. By exploiting an inherent trait of multiple-branch-based designs, our method enables highly efficient evaluations of clustering effects on this-type designs. We apply our method to the low-latency PRF {sf Orthros}, and show a best differential distinguisher reaching up to 7 rounds of {sf Orthros} with $2^{116.806}$ time/data complexity and 9-round distinguisher for each underlying permutation which is 2 more rounds than known longest distinguishers. Besides, we update the designer's security bound for differential attacks based on the lower bounds for the number of active S-boxes, and obtain the optimal differential characteristic of {sf Orthros}, {sf Branch 1}, and {sf Branch 2} for the first time. Consequently, we improve the designer's security bound from 9/12/12 to 7/10/10 rounds for {sf Orthros}/{sf Branch 1}/{sf Branch 2} based on a single differential characteristic. |
|
| キーワード | （和） | Differential cryptanalysis / Clustering effect / Multiple-branch- based designs / Orthros / SAT-based automatic search method / / / |
| （英） | / / / / / / / | |
| 文献情報 | 信学技報, vol. 123, no. 26, ISEC2023-12, pp. 65-65, 2023年5月. | |
| 資料番号 | ISEC2023-12 | |
| 発行日 | 2023-05-10 (ISEC) | |
| ISSN | Online edition: ISSN 2432-6380 | |
| 著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します．(許諾番号：10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| PDFダウンロード | ISEC2023-12 |
|
| 研究会情報 | |
| 研究会 | ISEC |
| 開催期間 | 2023-05-17 - 2023-05-17 |
| 開催地（和） | 機械振興会館 |
| 開催地（英） | Kikai-Shinko-Kaikan Bldg. |
| テーマ（和） | 一般 |
| テーマ（英） | |
| 講演論文情報の詳細 | |
| 申込み研究会 | ISEC |
| 会議コード | 2023-05-ISEC |
| 本文の言語 | 英語 |
| タイトル（和） | |
| サブタイトル（和） | |
| タイトル（英） | An Efficient Strategy to Construct a Better Differential on Multiple-Branch-Based Designs: Application to Orthros (from CT-RSA 2023) |
| サブタイトル（英） | |
| キーワード(1)（和/英） | Differential cryptanalysis / |
| キーワード(2)（和/英） | Clustering effect / |
| キーワード(3)（和/英） | Multiple-branch- based designs / |
| キーワード(4)（和/英） | Orthros / |
| キーワード(5)（和/英） | SAT-based automatic search method / |
| キーワード(6)（和/英） | / |
| キーワード(7)（和/英） | / |
| キーワード(8)（和/英） | / |
| 第1著者 氏名（和/英/ヨミ） | 髙 和真 / Kazuma Taka / タカ カズマ |
| 第1著者 所属（和/英） | 兵庫県立大学 (略称： 兵庫県立大) University of Hyogo (略称： Hyogo Univ.) |
| 第2著者 氏名（和/英/ヨミ） | 阪本 光星 / Kosei Sakamoto / サカモト コウセイ |
| 第2著者 所属（和/英） | 兵庫県立大学 (略称： 兵庫県立大) University of Hyogo (略称： Hyogo Univ.) |
| 第3著者 氏名（和/英/ヨミ） | 石川 達也 / Tatsuya Ishikawa / イシカワ タツヤ |
| 第3著者 所属（和/英） | WDB 工学株式会社 (略称： WDB工学) WDB KOUGAKU (略称： WDB KOUGAKU Co.,Ltd.) |
| 第4著者 氏名（和/英/ヨミ） | 五十部 孝典 / Takanori Isobe / イソベ タカノリ |
| 第4著者 所属（和/英） | 兵庫県立大学 (略称： 兵庫県立大) University of Hyogo (略称： Hyogo Univ.) |
| 講演者 | 第1著者 |
| 発表日時 | 2023-05-17 15:55:00 |
| 発表時間 | 30分 |
| 申込先研究会 | ISEC |
| 資料番号 | ISEC2023-12 |
| 巻番号（vol） | vol.123 |
| 号番号（no） | no.26 |
| ページ範囲 | p.65 |
| ページ数 | 1 |
| 発行日 | 2023-05-10 (ISEC) |
[研究会発表申込システムのトップページに戻る]