Paper 2011/422
Improved Analysis of ECHO-256
Jérémy Jean, María Naya-Plasencia, and Martin Schläffer
Abstract
ECHO-256 is a second-round candidate of the SHA-3 competition. It is an AES-based hash function that has attracted a lot of interest and analysis. Up to now, the best known attacks were a distinguisher on the full internal permutation and a collision on four rounds of its compression function. The latter was the best known analysis on the compression function as well as the one on the largest number of rounds so far. In this paper, we extend the compression function results to get a distinguisher on 7 out of 8 rounds using rebound techniques. We also present the first 5-round collision attack on the ECHO-256 hash function.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. extended version of paper published at SAC 2011
- Keywords
- hash functioncryptanalysisrebound attackcollision attackdistinguisher
- Contact author(s)
- martin schlaeffer @ iaik tugraz at
- History
- 2011-08-05: received
- Short URL
- https://ia.cr/2011/422
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2011/422,
author = {Jérémy Jean and María Naya-Plasencia and Martin Schläffer},
title = {Improved Analysis of {ECHO}-256},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/422},
year = {2011},
url = {https://eprint.iacr.org/2011/422}
}
