2017
DOI: 10.14529/cmse170302
|View full text |Cite
|
Sign up to set email alerts
|

Preimage Attack on MD4 Hash Function as a Problem of Parallel Sat-Based Cryptanalysis

Abstract: In this paper we study the inversion problem of MD4 cryptographic hash function developed by R. Rivest in 1990. By MD4-k we denote a truncated variant of MD4 hash function in which k represents a number of steps used to calculate a hash value (the full version of MD4 function corresponds to MD4-48). H. Dobbertin has showed that MD4-32 hash function is not one-way, namely, it can be inverted for the given image of a random input. He suggested to add special conditions to the equations that describe the computat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…Another approach based on the SAT for the MD-family hash functions was considered in Refs. [16,17]. In these papers, they used an idea similar to what we use in this work, but they converted the pre-image attack to the SAT problem as we convert it into the MILP problems.…”
mentioning
confidence: 99%
See 2 more Smart Citations
“…Another approach based on the SAT for the MD-family hash functions was considered in Refs. [16,17]. In these papers, they used an idea similar to what we use in this work, but they converted the pre-image attack to the SAT problem as we convert it into the MILP problems.…”
mentioning
confidence: 99%
“…In Ref. [16], they successfully committed an attack on the MD4 with 39 rounds under Dobbertin's conditions [18].…”
mentioning
confidence: 99%
See 1 more Smart Citation