Faster multicollision attack on Davies-Meyer hash function scheme implementing Simeck32/64 block cipher algorithm

International Conference on Design, Engineering and Computer Sciences 2018

工业技术;计算机科学

Wijitrisnanto, F.^1 ; Susanti, B.H.^1

Sekolah Tinggi Sandi Negara, Ciseeng, Bogor

16120, Indonesia^1

关键词: Birthday attacks;    Block cipher algorithms;    Block ciphers;    Compression functions;    Least significant bits;    Multi-collision attack;    Provably secure;    Systematic analysis;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/453/1/012011/pdf
DOI  :  10.1088/1757-899X/453/1/012011

来源: IOP

【 摘 要 】

Davies-Meyer is one scheme among 12 compression functions found through systematic analysis by Preneel et al. to be provably secure under black-box analysis. But in the development, this scheme proved to be vulnerable to fixed-point attack. With this vulnerability, it is possible to implement one of attack in an iterated hash function that exploits fixed-point weakness named faster multicollision attack. Implementing Simeck32/64 as an underlying block cipher, the attack induced by firstly searching for fixed-point collisions. To accomplish this finding stage based on Yuval's birthday attack, a sum of 2.2n/2 different fixed-point sequences are needed. Based on that, two sets of 216 different inputs are generated by modifying 16 bits of least significant bits from each pair of five input samples to find a collision between them. The final result makes an outstanding fact, with 4.194.304 total collisions obtained from five samples and 16 different IV values that already produced before in fixed-point collision finding stage. These facts conclude that Davies-Meyer scheme is not resistance against faster multicollision attack because of its fixed-point weakness.