The time complexity is less thanĮncryptions of 98-round KATAN32 and less thanĮncryptions of 99-round KATAN32, respectively. Based on the 81-round distinguisher, we recover 11 equivalent key bits of 98-round KATAN32 and 13 equivalent key bits of 99-round KATAN32. In particular, we present two distinguishers for 79 and 81 out of 254 rounds of KATAN32. The model is successfully applied to the block cipher KATAN32 in the single-key scenario, resulting in practical key-recovery attacks covering more rounds than the previous. In this paper, a new method for constructing a Mixed Integer Linear Programming (MILP) model on conditional differential cryptanalysis of the nonlinear feedback shift register- (NLFSR-) based block ciphers is proposed, and an approach to detecting the bit with a strongly biased difference is provided. We can extend these methods for the large sequences using programming and modern computers with large memory. In the current time there is an important problem that is for a received linear or nonlinear binary sequence of the form M-sequence, and these methods are very effectively.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |