Finding Good Differential Patterns for Attacks on SHA-1
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 164-177
- https://doi.org/10.1007/11779360_14
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Exploiting Coding Theory for Collision Attacks on SHA-1Published by Springer Nature ,2005
- Update on SHA-1Published by Springer Nature ,2005
- Near-Collisions of SHA-0Published by Springer Nature ,2004
- Cryptanalysis of 3-Pass HAVALPublished by Springer Nature ,2003
- Cryptanalysis of MD4Journal of Cryptology, 1998
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511IEEE Transactions on Information Theory, 1998
- RIPEMD with two-round compress function is not collision-freeJournal of Cryptology, 1997
- The intractability of computing the minimum distance of a codeIEEE Transactions on Information Theory, 1997
- An Attack on the Last Two Rounds of MD4Published by Springer Nature ,1992
- A probabilistic algorithm for computing minimum weights of large error-correcting codesIEEE Transactions on Information Theory, 1988