Equivalent Keys in RC6-32/20/176(Special Section on Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
RC6 is a common-key block cipher that was proposed as one of the AES candidates. Although any weakness of RC6 in the use of the confidentiality is not known, Saarinen pointed out the existence of almost equivalent keys in RC6 with 176-byte keys. This means that the Davies-Meyer hash function based on RC6 with 176-byte keys is not a good collision-resistance function. However, Saarinen could not find a precise collision of it. In this paper, we propose a practical method for obtaining a collision of the Davies-Meyer hash function based on RC6-32/20/176. In other words, there exist equivalent user supplied keys in RC6-32/20/176, and it is possible to obtain them practically. This means that the essential key space of RC6-32/20/176 is smaller than the space provided by 176-byte keys. Our computer simulation shows that a collision can be found in about 100 minutes. We should notice that the result of this paper does not affect the security of the AES version of RC6 because RC6-32/20/176 discussed in this paper is different from the parameter of the AES version.
- 社団法人電子情報通信学会の論文
- 2001-10-01
著者
-
TANAKA Hatsukazu
the Faculty of Engineering, Kobe University
-
Kuwakado Hidenori
The Faculty Of Engineering Kobe University
-
Mizuno H
Eisai Co. Ltd. Ibaraki Jpn
-
MIZUNO Hiroshi
the Graduate School of Science and Technology, Kobe Universtity
-
Tanaka Hatsukazu
The Faculty Of Engineering Kobe University
関連論文
- Efficient Relative Time-Stamping Scheme Based on the Ternary Link(Information Security)(Information Theory and Its Applications)
- Message Authentication for Stream(Special Section on Cryptography and Information Security)
- A New Digital Watermarking Scheme Applying Locally the Wavelet Transform
- A Code Construction for M-Choose-T Communication over the Multiple-Access Adder Channel
- Equivalent Keys in RC6-32/20/176(Special Section on Information Theory and Its Applications)
- Improvement on the Cheater Identifiable Threshold Scheme(Special Section on Fundamentals of Information and Communications)
- New Algorithm for Finding Preimages in a Reduced Version of the MD4 Compression Function(Special Section on Cryptography and Information Security)