Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Finding SHA-1 characteristics: general results and applications
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
RC4-hash: a new hash function based on RC4
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
A failure-friendly design principle for hash functions
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Efficient collision search attacks on SHA-0
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Finding collisions in the full SHA-1
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
How to break MD5 and other hash functions
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Second preimages on n-bit hash functions for much less than 2n work
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Generalized RC4 key collisions and hash collisions
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Cryptanalysis of RC4-based hash function
AISC '12 Proceedings of the Tenth Australasian Information Security Conference - Volume 125
| Hi-index | 0.00 |
RC4-Hash is a variable digest length cryptographic hash function based on the design of the RC4 stream cipher. In this paper, we show that RC4-Hash is not collision resistant. Collisions for any digest length can be found with an expected effort of less than 29compression function evaluations. This is extended to multicollisions for RC4-Hash. Finding a set of 2kcolliding messages has an expected cost of 27+ k·28compression function evaluations.