
Advanced encryption standard based on key dependent S‐Box cube
Author(s) -
Seghier Athmane,
Li Jianxin,
Sun Da Zhi
Publication year - 2019
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2018.5043
Subject(s) - advanced encryption standard , s box , block cipher , encryption , computer science , cryptanalysis , cryptography , key (lock) , cryptographic primitive , symmetric key algorithm , theoretical computer science , robustness (evolution) , randomness , differential cryptanalysis , cipher , cube (algebra) , algorithm , public key cryptography , mathematics , cryptographic protocol , computer security , statistics , combinatorics , biochemistry , chemistry , gene
The advanced encryption standard (AES) is the most encryption algorithm used around the world. This fact made it coveted by several cryptanalysis attacks. Some of them succeed to reveal certain weakness, due to its static parameters known by the public mass. The substitution box (S‐Box) is among the most sensitive parameters of this standard, which plays a crucial role in the protection against these attacks. In this study, a new version of AES is introduced, which uses a set of AES‐like S‐Boxes instead of the original one. These S‐Boxes, generated from different irreducible polynomials, are dynamically chosen, depending on the encryption key. This introduction is conducted by the design and the implementation of a new block cipher version of AES, based on a key dependent S‐Box cube. Where a cube of six interchangeable S‐Boxes key‐dependently generated is constructed. This cube determines the active S‐Box for a given round, through its random rotations guided by the round key. Furthermore, the improvement of the cryptographic robustness, provided by this method is demonstrated. This is accomplished through a comparison with the original AES, in terms of statistical and cryptographic randomness properties.