9269.
To evaluate the security of
![]()
![]()
algorithm in impossible differential cryptanalysis, a 9-round impossible differential distinguisher of
![]()
![]()
algorithm was constructed based on matrix method and meet-in-the middle technique firstly. Then, with the utilization of key-bridge technique, a 13-round key recovery attack was presented to
![]()
![]()
algorithm by expanding the 9-round distinguisher forward and backward 2 rounds, respectively. The results show that the master key can be recovered 45 bit in the attack, the data complexity of plaintexts is
![]()
![]()
, and the time complexity of 13 rounds of algorithm encryptions is
![]()
![]()
. Compared with the previous research, the study achieves the longest attack rounds, and the data complexity is effectively reduced.… …
相似文献