Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions
We provide a survey about generic attacks on cryptographic hash constructions including hash-based message authentication codes and hash combiners. We look into attacks involving iteratively evaluating identical mappings many times. The functional graph of a random mapping also involves iteratively...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2018-03-01
|
Series: | IACR Transactions on Symmetric Cryptology |
Subjects: | |
Online Access: | https://tosc.iacr.org/index.php/ToSC/article/view/850 |
id |
doaj-5c839d0937f7467f9bf9e3c682ea86cc |
---|---|
record_format |
Article |
spelling |
doaj-5c839d0937f7467f9bf9e3c682ea86cc2021-03-02T10:24:27ZengRuhr-Universität BochumIACR Transactions on Symmetric Cryptology2519-173X2018-03-0120125310.13154/tosc.v2018.i1.201-253850Functional Graphs and Their Applications in Generic Attacks on Iterated Hash ConstructionsZhenzhen Bao0Jian Guo1Lei Wang2School of Physical and Mathematical Sciences, Nanyang Technological UniversitySchool of Physical and Mathematical Sciences, Nanyang Technological UniversityShanghai Jiao Tong University, Shanghai; Westone Cryptologic Research Center, BeijingWe provide a survey about generic attacks on cryptographic hash constructions including hash-based message authentication codes and hash combiners. We look into attacks involving iteratively evaluating identical mappings many times. The functional graph of a random mapping also involves iteratively evaluating the mapping. These attacks essentially exploit properties of the functional graph. We map the utilization space of those properties from numerous proposed known attacks, draw a comparison among classes of attacks about their advantages and limitations. We provide a systematic exposition of concepts of cycles, deep-iterate images, collisions and their roles in cryptanalysis of iterated hash constructions. We identify the inherent relationship between these concepts, such that case-by-case theories about them can be unified into one knowledge system, that is, theories on the functional graph of random mappings. We show that the properties of the cycle search algorithm, the chain evaluation algorithm and the collision search algorithm can be described based on statistic results on the functional graph. Thereby, we can provide different viewpoints to support previous beliefs on individual knowledge. In that, we invite more sophisticated analysis of the functional graph of random mappings and more future exploitations of its properties in cryptanalysis.https://tosc.iacr.org/index.php/ToSC/article/view/850Functional graphhash-based MACHash combinerCycleDeep-iterate imageCollisionState recovery attackForgery attack(Second) Preimage attack |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Zhenzhen Bao Jian Guo Lei Wang |
spellingShingle |
Zhenzhen Bao Jian Guo Lei Wang Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions IACR Transactions on Symmetric Cryptology Functional graph hash-based MAC Hash combiner Cycle Deep-iterate image Collision State recovery attack Forgery attack (Second) Preimage attack |
author_facet |
Zhenzhen Bao Jian Guo Lei Wang |
author_sort |
Zhenzhen Bao |
title |
Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions |
title_short |
Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions |
title_full |
Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions |
title_fullStr |
Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions |
title_full_unstemmed |
Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions |
title_sort |
functional graphs and their applications in generic attacks on iterated hash constructions |
publisher |
Ruhr-Universität Bochum |
series |
IACR Transactions on Symmetric Cryptology |
issn |
2519-173X |
publishDate |
2018-03-01 |
description |
We provide a survey about generic attacks on cryptographic hash constructions including hash-based message authentication codes and hash combiners. We look into attacks involving iteratively evaluating identical mappings many times. The functional graph of a random mapping also involves iteratively evaluating the mapping. These attacks essentially exploit properties of the functional graph. We map the utilization space of those properties from numerous proposed known attacks, draw a comparison among classes of attacks about their advantages and limitations. We provide a systematic exposition of concepts of cycles, deep-iterate images, collisions and their roles in cryptanalysis of iterated hash constructions. We identify the inherent relationship between these concepts, such that case-by-case theories about them can be unified into one knowledge system, that is, theories on the functional graph of random mappings. We show that the properties of the cycle search algorithm, the chain evaluation algorithm and the collision search algorithm can be described based on statistic results on the functional graph. Thereby, we can provide different viewpoints to support previous beliefs on individual knowledge. In that, we invite more sophisticated analysis of the functional graph of random mappings and more future exploitations of its properties in cryptanalysis. |
topic |
Functional graph hash-based MAC Hash combiner Cycle Deep-iterate image Collision State recovery attack Forgery attack (Second) Preimage attack |
url |
https://tosc.iacr.org/index.php/ToSC/article/view/850 |
work_keys_str_mv |
AT zhenzhenbao functionalgraphsandtheirapplicationsingenericattacksoniteratedhashconstructions AT jianguo functionalgraphsandtheirapplicationsingenericattacksoniteratedhashconstructions AT leiwang functionalgraphsandtheirapplicationsingenericattacksoniteratedhashconstructions |
_version_ |
1724236935749173248 |