BLAKE2: Simpler, Smaller, Fast as MD5
- 1 January 2013
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Third-Round Report of the SHA-3 Cryptographic Hash Algorithm CompetitionPublished by National Institute of Standards and Technology (NIST) ,2012
- Boomerang Attacks on BLAKE-32Lecture Notes in Computer Science, 2011
- The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 CompetitionLecture Notes in Computer Science, 2010
- Near-Collisions on the Reduced-Round Compression Functions of Skein and BLAKELecture Notes in Computer Science, 2010
- Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA CertificateLecture Notes in Computer Science, 2009
- The Hash Function Family LAKELecture Notes in Computer Science, 2008
- On the Indifferentiability of the Sponge ConstructionLecture Notes in Computer Science, 2008
- Strengthening Digital Signatures Via Randomized HashingLecture Notes in Computer Science, 2006
- Multicollisions in Iterated Hash Functions. Application to Cascaded ConstructionsLecture Notes in Computer Science, 2004