Difference between revisions of "RC4-HASH"
From The ECRYPT Hash Function Website
(→Collision Attacks) |
(→Best Known Results) |
||
| Line 27: | Line 27: | ||
=== Best Known Results === | === Best Known Results === | ||
| + | |||
| + | Practical collision attack by Indesteege and Preneel for any digest length with an expected complexity of less than 2<sup>9</sup> compression function evaluations. | ||
---- | ---- | ||
Latest revision as of 14:40, 10 November 2008
Contents
1 Specification
- digest size: 8*k bits with 15 < k < 65
- max. message length: < 264
- compression function: based on RC4
- Specification:
Donghoon Chang, Kishan Chand Gupta, Mridul Nandi - RC4-Hash: A New Hash Function Based on RC4
- INDOCRYPT 4329:80-94,2006
- http://dx.doi.org/10.1007/11941378_7
BibtexAuthor : Donghoon Chang, Kishan Chand Gupta, Mridul Nandi
Title : RC4-Hash: A New Hash Function Based on RC4
In : INDOCRYPT -
Address :
Date : 2006
2 Cryptanalysis
2.1 Best Known Results
Practical collision attack by Indesteege and Preneel for any digest length with an expected complexity of less than 29 compression function evaluations.
2.2 Generic Attacks
2.3 Collision Attacks
Sebastiaan Indesteege, Bart Preneel - Collisions for RC4-Hash
- ISC 5222:355-366,2008
- http://dx.doi.org/10.1007/978-3-540-85886-7_25
BibtexAuthor : Sebastiaan Indesteege, Bart Preneel
Title : Collisions for RC4-Hash
In : ISC -
Address :
Date : 2008
