|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/11416
|
| タイトル: | Novel Strategies for Searching RC4 Key Collisions |
| 著者: | Chen, Jiageng
Miyaji, Atsuko |
| キーワード: | RC4
Key Collision
Searching Algorithm
Transitional Pattern
Self-Absorbing Pattern |
| 発行日: | 2013 |
| 出版者: | Elsevier |
| 誌名: | Computers & Mathematics with Applications |
| 巻: | 66 |
| 号: | 1 |
| 開始ページ: | 81 |
| 終了ページ: | 90 |
| DOI: | 10.1016/j.camwa.2012.09.013 |
| 抄録: | The property that the stream cipher RC4 can generate the same keystream outputs under two different secret keys has been discovered recently. The principle that how the two different keys can achieve a collision has been studied in the previous researches by investigating the key scheduling algorithm of RC4. However, how to find those colliding key pairs is a different story, which has been largely remained unexploited. Previous researches have demonstrated that finding colliding key pairs becomes more difficult as the key size decreases, and also finding key collisions can be related to key recovery attacks and hash collisions. In this paper, we propose novel searching techniques which can be used to find short colliding key pairs that belong to two different kind of colliding key patterns efficiently. The colliding key pairs we find in both patterns are by far the shortest ones ever found. |
| Rights: | NOTICE: This is the author's version of a work accepted for publication by Elsevier. Jiageng Chen, Atsuko Miyaji, Computers & Mathematics with Applications, 66(1), 2013, 81-90, http://dx.doi.org/10.1016/j.camwa.2012.09.013 |
| URI: | http://hdl.handle.net/10119/11416 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 19182.pdf | | 381Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
