|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/10295
|
| タイトル: | How to Find Short RC4 Colliding Key Pairs |
| 著者: | Chen, Jiageng
Miyaji, Atsuko |
| キーワード: | RC 4
Colliding Key Pairs |
| 発行日: | 2011-10-12 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 7001/2011 |
| 開始ページ: | 32 |
| 終了ページ: | 46 |
| DOI: | 10.1007/978-3-642-24861-0_3 |
| 抄録: | 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 is well known 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. The main contribution of this paper is proposing an efficient searching algorithm which can successfully find 22-byte colliding key pairs, which are by far the shortest colliding key pairs ever found. |
| Rights: | This is the author-created version of Springer, Jiageng Chen and Atsuko Miyaji, Lecture Notes in Computer Science, 7001/2011, 2011, 32-46. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-24861-0_3 |
| URI: | http://hdl.handle.net/10119/10295 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 17284.pdf | | 353Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
