Collisions for RC4-Hash
From MaRDI portal
Publication:3540156
DOI10.1007/978-3-540-85886-7_25zbMath1182.94041OpenAlexW1507819580MaRDI QIDQ3540156
Sebastiaan Indesteege, Bart Preneel
Publication date: 20 November 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://www.cosic.esat.kuleuven.be/publications/article-1133.pdf
Related Items (2)
Cites Work
- Unnamed Item
- Advances in Cryptology – CRYPTO 2004
- How to Break MD5 and Other Hash Functions
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Efficient Collision Search Attacks on SHA-0
- Finding Collisions in the Full SHA-1
- A Failure-Friendly Design Principle for Hash Functions
- RC4-Hash: A New Hash Function Based on RC4
- Finding SHA-1 Characteristics: General Results and Applications
This page was built for publication: Collisions for RC4-Hash