Near-Collisions for the Reduced Round Versions of Some Second Round SHA-3 Compression Functions Using Hill Climbing
- 1 January 2010
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- The traveling salesman problem:Published by JSTOR ,2018
- Using genetic algorithm to find near collisions for the compress function of Hamsi-256Published by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Differential and Invertibility Properties of BLAKELecture Notes in Computer Science, 2010
- Near-Collisions on the Reduced-Round Compression Functions of Skein and BLAKELecture Notes in Computer Science, 2010
- The Rebound Attack: Cryptanalysis of Reduced Whirlpool and GrøstlLecture Notes in Computer Science, 2009
- Cryptanalysis of Hash Functions with StructuresLecture Notes in Computer Science, 2009
- The Design of Boolean Functions by Modified Hill Climbing MethodPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Collisions and Near-Collisions for Reduced-Round TigerLecture Notes in Computer Science, 2006
- Boolean Function Design Using Hill Climbing MethodsLecture Notes in Computer Science, 1999
- Heuristic design of cryptographically strong balanced Boolean functionsPublished by Springer Science and Business Media LLC ,1998