This paper proposes a new chaos AES algorithm for data security. The algorithm is based on substituting the Rijndael affine transformation S-box by another one based on chaos theory. The new S-box has a low correlation and exhibits a significant performance improvement with an acceptable complexity addition. The algorithm is tested using the commonly used tests for determining whether the binary sequence possesses some specific characteristics that a truly random sequence would be likely to exhibit. These are frequency, runs, serial and poker tests, respectively. These statistical tests are performed with random and uniform distribution plaintext data. The results of the proposed chaos AES were compared with a normal one and gave a significant improvement for the accepted sequences probability over a wide range of chaos initial conditions. The sensitivity of the initial condition gives the algorithm the ability to be used as another key for more security and confidentiality.
展开▼
