A novel technique for the construction of strong S-boxes based on chaotic Lorenz systems

Abstract

In cryptographic systems, the encryption process relies on the nonlinear mapping of original data or plaintext to the secure data. The mapping of data is facilitated by the application of the substitution process embedded in the cipher. It is desirable to have resistance against differential cryptanalysis, which assists in providing clues about the composition of keys, and linear secret system, where a simple approximation is created to emulate the original cipher characteristics. In this work, we propose the use of nonlinear functional chaos-based substitution process which employs a continuous time Lorenz system. The proposed substitution system eliminates the need of independent round keys in a substitution-permutation network. The performance of the new substitution box is evaluated by nonlinearity analysis, strict avalanche criterion, bit independence criterion, linear approximation probability, and differential approximation probability.