A method for designing dynamical S-boxes based on discretized chaotic map

Chaos, Solitons and Fractals

Volumn 23, Issue 5, 2005, Pages 1901-1909

  Tang, Guoping ^a,b   Liao, Xiaofeng ^a  

^a CHONGQING UNIVERSITY   (China)

^b PLA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CRYPTOGRAPHY; LYAPUNOV METHODS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; NUMERICAL ANALYSIS; VECTORS;

CHAOTIC MAPS; DATA ENCRYPTION STANDARD (DES); NONLINEAR MAPPINGS; VECTOR SPACES;

CHAOS THEORY;

EID: 9544225075     PISSN: 09600779     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0960-0779(04)00454-0     Document Type: Article

References (27)

1. Shannon CE. Communication theory of secrecy systems. Bell Syst Tech J 1949;28:656-715.
2. Webster AF, Tavares SE. On the design of S-boxes. In: Advances in cryptology: Proc of CRYPTO'85. New York: Springer-Verlag; 1986. p. 523-34.
3. Dawson M, Tavares SE. An expanded set of S-box design criteria based on information theory and its relation to differential-like attacks. In: Advances in cryptology: Proc of Eurocrypt'91. New York: Springer-Verlag; 1991. p. 352-67.
4. Detombe J, Tavares S. Constructing large cryptographically strong S-boxes. In: Advances in cryptology: Proc. of CRYPTO92. In: Lecture notes in computer science; 1992.
5. Forre R. The strict avalanche criterion: spectral properties of Boolean functions and an extended definition. In: Advances in cryptology: Proc of CRYPTO'88. Berlin: Springer-Verlag; 1989.
6. Adamas C, Tavares S. Good S-boxes are easy to find. In: Advances in cryptology: Proc. of CRYPTO'89. In: Lecture notes in computer science; 1989. p. 612-5.
7. Adams C, Tavares S. The structured design of cryptographically good S-boxes. J Cryptol 1990;3(1):27-41.
8. Yi X, Cheng S, You X. A method for obtaining cryptographically strong 8 × 8 S-boxes. Global telecommunications conference, GLOBECOM'97, 3-8 November 1997, vol. 2. New York: IEEE; 1997. p. 689-93.
9. Jakimoski G, Kocarev L. Chaos and cryptography: block encryption ciphers. IEEE Trans Cire Syst - I 2001;48(2):163-70.
10. Ritter T. Substitution cipher with pseudo-random shuffling: the dynamic substitution comber. Cryptologia 1990;14(4):289-303.
11. Ritter T. Transposition cipher with pseudo-random shuffling: the dynamic substitution comber. Cryptologia 1991;15(1):1-17.
12. EL-Ramly SH, ael-Garf T, Soliman AH. Dynamic generation of S-boxes in block cipher systems. In: Eighteenth national radio science conference, 27-29 March 2001, Mansoura University, Egypt.
13. Wong K-W. A fast chaotic cryptographic scheme with dynamic lookup table. Phys Lett A 2002;298(4):238-42.
14. Guo D, Cheng LM, Cheng LL. A new symmetric probabilistic encryption scheme based on chaotic attractors of neural networks. Appl Intell 1999;10(1):71-84.
15. Uis J, Ugalde E, Salazar G. A cryptosystem based on cellular automata. Chaos 1998;8(4):819-22.
16. Li S, Zheng X, Mou X, Cai Y. Chaotic encryption scheme for real-time digital video. In: Real-time imaging VI. Proceedings of SPIE, vol. 4666. p. 149-60.
17. Masuda N, Aihara K. Cryptosystems with discretized chaotic maps. IEEE Trans Cire Syst - I 2002;49(1):28-40.
18. Dawson MH, Tavares SE. An expanded set of design criteria for substitution boxes and their use in strengthening DES-like cryptosystems. In: IEEE Pacific rim conference on communications, computers and signal processing, 9-13 May 1991. p. 191-5.
19. Biham E, Shamir A. Differential cryptanalysis of DES-like cryptosystems. J Cryptol 1991;4(1):3-72.
20. Wheeler DD, Matthews RAJ. Supercomputer investigations of a chaotic encryption algorithm. Cryptologia 1991;XV(2):140-51.
21. Zhou H, Ling X-T. Problems with the chaotic inverse system encryption approach. IEEE Trans Cire Syst - I 1997;44(3):268-71.
22. Li S, Mou X, Yang BL, Ji Z, Zhang J. Problems with a probabilistic encryption scheme based on chaotic systems. Int J Bifurc Chaos 2003;11(10):3063-77.
23. Masuda N, Aihara K. Dynamical characteristics of discretized chaotic permutations. Int J Bifurc Chaos 2002;12(10):2087-103.
24. Li S. Analyses and new designs of digital chaotic ciphers. PhD thesis, School of Electronics & Information Engineering, Xi'an Jiaotong University, Xi'an, China. Available from: http://www.hooklee.com/pub.html.
25. Gonzalo Álvarez, Li S. Cryptographic requirements for chaotic secure communications. Available from: http://arxiv.org/abs/nlin.CD/0311039.
26. Habutsu T, Nishio Y. A secret key cryptosystem by iterating a chaotic map. In: Advances in cryptology - EuroCrypt'91. Lecture notes in computer science 0547. Berlin: Spinger-Verlag; 1991. p. 127-40.
27. Tang GP, Liao XF, Chen Y. A novel method for designing S-boxes based on chaotic maps. Chaos, Solitons & Fractals 2005;23:413-9.