In this paper, we describe an attack on a new double block length hash function which was proposed as a variant of MDC-2 and MDC-4. The vMDC-2 compression function is based on two calls to a block cipher that compresses a 3n-bit string to a 2n-bit one. This attack is based on the Joux's multicollision attack, where we show that an adversary wins finding collision game by requesting $2^{70}$ queries for $ n=128$-bit block cipher that is much less than the complexity of birthday attack.
Zolfaghari, Z. , Asadollahi, H. and Bagheri, N. (2016). Multicollision Attack on a recently proposed hash function vMDC-2. Journal of Computing and Security, 3(4), 211-215.
MLA
Zolfaghari, Z. , , Asadollahi, H. , and Bagheri, N. . "Multicollision Attack on a recently proposed hash function vMDC-2", Journal of Computing and Security, 3, 4, 2016, 211-215.
HARVARD
Zolfaghari, Z., Asadollahi, H., Bagheri, N. (2016). 'Multicollision Attack on a recently proposed hash function vMDC-2', Journal of Computing and Security, 3(4), pp. 211-215.
CHICAGO
Z. Zolfaghari , H. Asadollahi and N. Bagheri, "Multicollision Attack on a recently proposed hash function vMDC-2," Journal of Computing and Security, 3 4 (2016): 211-215,
VANCOUVER
Zolfaghari, Z., Asadollahi, H., Bagheri, N. Multicollision Attack on a recently proposed hash function vMDC-2. Journal of Computing and Security, 2016; 3(4): 211-215.
)