Parallel algorithm to find collision in Merkle-Damgard construction with fixed point for 2n/2/k work

In this paper we provide method a collision attack on all n-bit iterated hash functions with Merkle-Damgard construction use parallel algorithm, allowing a collision to be found for a 2
ⁿ
block message and k-sum of computer with about 2
^n/2
/k work. Davies-Meyer scheme using SIMECK-32 algorithm as an example, our attack can find a collision for a 2
³²
bit total output with 8 computer become 2
¹³
work for each computer. The result of this research is plaintext that meets the characteristics of fixed point that does not affect the plaintext hash value because the resulting output is the used IV value itself. Plaintext is used to construct collision. Apparently the result of the application of the Davies-Meyer scheme is not resistant to collision attack because there are three fixed point in the two IV samples which are used.