TY - JOUR
T1 - Complexity analysis of distinguishing attack on 51-step RIPEMD-160
AU - Cui, Binbin
AU - Wang, Gaoli
N1 - Publisher Copyright:
© 2019, Editorial Office of Computer Engineering. All rights reserved.
PY - 2019/9
Y1 - 2019/9
N2 - SASAKI Y, et al used message modification technology to differentiate attack on 51-step RIPEMD-160(Lecture Notes in Computer Science, Vol. 7341), but they did not consider the influence of modular subtraction difference on differential routes, and could not guarantee that the probability of the validation of the first half of the left and right operations is 1, which led to the error in the complexity of RIPEMD-160. For this reason, RIPEMD-160 differentiator is constructed by 2-dimension sums method and an improved distinguishing attack complexity analysis method is proposed. Sufficient conditions are given to ensure the validation of modular subtraction difference in differential routes. The probability of the validation of the first half of differential routes of left and right operations is increased from 2-7. 717 to 1 after message modification. The probability of the validation of differential routes of the second half is obtained through experimental tests. The analysis results show that the complexity of distinguishing attacks on 51-step RIPEMD-160 is 2152. 672.
AB - SASAKI Y, et al used message modification technology to differentiate attack on 51-step RIPEMD-160(Lecture Notes in Computer Science, Vol. 7341), but they did not consider the influence of modular subtraction difference on differential routes, and could not guarantee that the probability of the validation of the first half of the left and right operations is 1, which led to the error in the complexity of RIPEMD-160. For this reason, RIPEMD-160 differentiator is constructed by 2-dimension sums method and an improved distinguishing attack complexity analysis method is proposed. Sufficient conditions are given to ensure the validation of modular subtraction difference in differential routes. The probability of the validation of the first half of differential routes of left and right operations is increased from 2-7. 717 to 1 after message modification. The probability of the validation of differential routes of the second half is obtained through experimental tests. The analysis results show that the complexity of distinguishing attacks on 51-step RIPEMD-160 is 2152. 672.
KW - Boomerang distinguisher
KW - Message modification
KW - Modular subtraction difference
KW - RIPEMD-160 algorithm
KW - Sufficient condition
UR - https://www.scopus.com/pages/publications/85160051685
U2 - 10.19678/j.issn.1000-3428.0052363
DO - 10.19678/j.issn.1000-3428.0052363
M3 - 文章
AN - SCOPUS:85160051685
SN - 1000-3428
VL - 45
SP - 147
EP - 152
JO - Jisuanji Gongcheng/Computer Engineering
JF - Jisuanji Gongcheng/Computer Engineering
IS - 9
ER -