مؤتمر
Improved Analysis of ECHO-256
| العنوان: | Improved Analysis of ECHO-256 |
|---|---|
| المؤلفون: | Jean, Jérémy, Naya-Plasencia, María, Schläffer, Martin |
| المساهمون: | Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Fachhochschule Nordwestschweiz Windisch (FHNW), Institute of Applied Information Processing and Communications Graz (IAIK), Graz University of Technology Graz (TU Graz), Ali Miri, Serge Vaudenay |
| المصدر: | SAC 2011 - 18th International Workshop Selected Areas in Cryptography ; https://hal.inria.fr/hal-01110465Test ; SAC 2011 - 18th International Workshop Selected Areas in Cryptography, Aug 2011, Toronto, Canada. pp.19-36, ⟨10.1007/978-3-642-28496-0_2⟩ |
| بيانات النشر: | HAL CCSD Springer |
| سنة النشر: | 2011 |
| المجموعة: | Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe) |
| مصطلحات موضوعية: | hash function, cryptanalysis, distinguisher, collision attack, rebound attack, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] |
| جغرافية الموضوع: | Toronto |
| الوقت: | Toronto, Canada |
| الوصف: | International audience ; 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. |
| نوع الوثيقة: | conference object |
| اللغة: | English |
| العلاقة: | hal-01110465; https://hal.inria.fr/hal-01110465Test |
| DOI: | 10.1007/978-3-642-28496-0_2 |
| الإتاحة: | https://doi.org/10.1007/978-3-642-28496-0_2Test https://hal.inria.fr/hal-01110465Test |
| رقم الانضمام: | edsbas.86AA274F |
| قاعدة البيانات: | BASE |
| DOI: | 10.1007/978-3-642-28496-0_2 |
|---|