Linear cryptanalysis of the SM4 block cipher algorithm

Lingyun, Liu

Al-Farg'oniy avlodlari · 2024-yil

Annotatsiya

In this paper, the Chinese block cipher algorithm SM4 is evaluated as a linear cryptanalysis method. As a result of the analysis, it was found that 2^126.4 plaintext and ciphertext pairs and 2^121.7 time complexity are required for 23 rounds of the SM4 algorithm for linear cryptanalysis. And to implement the round 23 attack by the multidimensional linear cryptanalysis required N = 2^122.3 plaintext and ciphertext pairs. The time complexity is equivalent to 2^122.5.

Maqola ma’lumotlari
MualliflarLingyun, Liu
JurnalAl-Farg'oniy avlodlari
Nashr sanasi2024-03-25
Jild1
Son1
Betlar17-22
TilRus

Kalit so‘zlar

cryptographic, linear attack, differential attack, multidimensional linear attack, approximations, XOR, Branching operation, linear transformation, S-box

Ilmiy soha

Al-Farg'oniy avlodlari jurnalidan boshqa maqolalar

Al-Farg'oniy avlodlari — barcha maqolalar