A new counting method to bound the number of active S-boxes in Rijndael and 3D

• Published in: Designs, codes, and cryptography Vol. 83; no. 2; pp. 327 - 343
• Main Authors: Sajadieh, Mahdi, Mirzaei, Arash, Mala, Hamid, Rijmen, Vincent
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.05.2017; Springer Nature B.V
• Subjects: Boxes; Circuits; Coding and Information Theory; Computer Science; Cryptography; Cryptology; Data Structures and Information Theory; Discrete Mathematics in Computer Science; Encryption; Information and Communication; Lower bounds; Active S-box; 3D; Rijndael; 11T71; 14G50; Block cipher
• ISSN: 0925-1022; 1573-7586
• DOI: 10.1007/s10623-016-0217-4

Security against differential and linear cryptanalysis is an essential requirement for modern block ciphers. This measure is usually evaluated by finding a lower bound for the minimum number of active S-boxes. The 128-bit block cipher AES which was adopted by National Institute of Standards and Technology (NIST) as a symmetric encryption standard in 2001 is a member of Rijndael family of block ciphers. For Rijndael, the block length and the key length can be independently specified to 128, 192 or 256 bits. It has been proved that for all variants of Rijndael the lower bound of the number of active S-boxes for any 4-round differential or linear trail is 25, and for 4 r ( r ≥ 1 ) rounds 25 r active S-boxes is a tight bound only for Rijndael with block length 128. In this paper, a new counting method is introduced to find tighter lower bounds for the minimum number of active S-boxes for several consecutive rounds of Rijndael with larger block lengths. The new method shows that 12 and 14 rounds of Rijndael with 192-bit block length have at least 87 and 103 active S-boxes, respectively. Also the corresponding bounds for Rijndael with 256-bit block are 105 and 120, respectively. Additionally, a modified version of Rijndael-192 is proposed for which the minimum number of active S-boxes is more than that of Rijndael-192. Moreover, we extend the method to obtain a better lower bound for the number of active S-boxes for the block cipher 3D. Our counting method shows that, for example, 20 and 22 rounds of 3D have at least 185 and 205 active S-boxes, respectively.