How to Find Short RC4 Colliding Key Pairs

• Chen, Jiageng

• Miyaji, Atsuko

抄録

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.

identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/10295

収録刊行物

• Lecture Notes in Computer Science

  Lecture Notes in Computer Science 7001/2011 32-46, 2011-10-12

  Springer

キーワード

• RC 4
• Colliding Key Pairs

詳細情報

• CRID: 1050282812515030016
• NII論文ID: 120003752194
• ISSN: 03029743
• Web Site: http://hdl.handle.net/10119/10295
• 本文言語コード: en
• 資料種別: journal article
• データソース種別:
  • IRDB
  • CiNii Articles