A method for designing dynamical S-boxes based on discrete chaos map system

This paper presents a method for obtaining dynamically cryptographically strong substitution boxes (Sboxes) based on discrete chaos map system (DCMS). The cryptographical properties such as bijection, nonlinearity, strict avalanche, output bits independence and equiprobable input/output XOR distribution of these S-boxes are analyzed in detail. The results of numerical analysis show that all the criteria for designing good S-box can be satisfied approximately. As a result, our approach is suitable for practical application in designing block cryptosystem.

[1]  Lequan Min,et al.  A generalized synchronization theorem for discrete-time chaos system with application in data encryption scheme , 2007, 2007 International Conference on Communications, Circuits and Systems.

[2]  S.H. El-Ramly,et al.  Dynamic generation of s-boxes in block cipher systems , 2001, Proceedings of the Eighteenth National Radio Science Conference. NRSC'2001 (IEEE Cat. No.01EX462).

[3]  Lequan Min,et al.  A Generalized Chaos Synchronization Based Digital Signature Scheme with Application , 2008, Security and Management.

[4]  Xiaofeng Liao,et al.  A novel method for designing S-boxes based on chaotic maps , 2005 .

[5]  Kwok-Yan Lam,et al.  A method for obtaining cryptographically strong 8/spl times/8 S-boxes , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[6]  Donghui Guo,et al.  A New Symmetric Probabilistic Encryption Scheme Based on Chaotic Attractors of Neural Networks , 2004, Applied Intelligence.

[7]  Terry Ritter,et al.  Substitution Cipher with Pseudo-Random Shuffling: the Dynamic Substitution Combiner , 1990, Cryptologia.

[8]  Stafford E. Tavares,et al.  An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks , 1991, EUROCRYPT.

[9]  Carlisle M. Adams,et al.  Good S-Boxes Are Easy To Find , 1989, CRYPTO.

[10]  Carlisle M. Adams,et al.  The structured design of cryptographically good s-boxes , 1990, Journal of Cryptology.

[11]  Eli Biham,et al.  Differential cryptanalysis of DES-like cryptosystems , 1990, Journal of Cryptology.

[12]  Stafford E. Tavares,et al.  Constructing Large Cryptographically Strong S-boxes , 1992, AUSCRYPT.

[13]  T. Kohda,et al.  Statistics of chaotic binary sequences , 1997, IEEE Trans. Inf. Theory.

[14]  L. Kocarev,et al.  Chaos and cryptography: block encryption ciphers based on chaotic maps , 2001 .

[15]  Josef Pieprzyk,et al.  Towards effective nonlinear cryptosystem design , 1988 .

[16]  Gelasio Salazar,et al.  A cryptosystem based on cellular automata. , 1998, Chaos.

[17]  Stafford E. Tavares,et al.  On the Design of S-Boxes , 1985, CRYPTO.

[18]  Terry Ritter,et al.  Transposition Cipher with Pseudo-Random Shuffling: the Dynamic Transposition Combiner , 1991, Cryptologia.

[19]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..