Abstract
In cryptography, an S-Box (Substitution-box) is a basic component of symmetric key algorithms which performs substitution and is typically used to obscure the relationship between the key and the cipher text. This paper proposes a new method for design of S boxes based on chaos theory. Chaotic equations are popularly known for its randomness, extreme sensitivity to initial conditions and ergodicity. The modified design has been tested with blowfish algorithm which has no effective crypt analysis reported against its design till date because of its salient design features including the key dependant s boxes and complex keys. However every new key requires pre-processing equivalent to encrypting about 4 kilobytes of text, which is very slow compared to other block ciphers and it prevents its usage in memory limited applications and embedded systems. The modified design of S boxes maintains the non linearity[2][4] and key dependency factors of S boxes with a major reduction in time complexity of generation of S boxes and P arrays. The algorithm has been implemented and the proposed design has been analyzed for size of key space, key sensitivity and Avalanche effect. Experimental results on text encryption show that the modified design of key generation continues to offer the same level of security as the original Blowfish cipher with a less computational overhead in key generation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Daemen, J., Govaerts, R., Vandewalle, J.: Correlation Matrices. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 275–285. Springer, Heidelberg (1995)
Youssef, A., Tavares, S., Mister, S., Adams, C.: Linear Approximation of Injective S-boxes. IEE Electronics Letters 31(25), 2168–2169 (1995)
Jiri, F.: Symmetric ciphers based on two dimensional chaotic maps. Int. J. Bifurcat. Chaos 8(6), 1259–1284 (1998)
Youssef, A., Tavares, S.: Number of Nonlinear Regular S-boxes. IEE Electronics Letters 31(19), 1643–1644 (1995)
Zhang, X., Zheng, Y.: GAC – the Criterion for Global Avalanche Characteristics of Cryptographic Functions. Journal for Universal Computer Science 1(5), 316–333 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chandrasekaran, J., Subramanyan, B., Selvanayagam, R. (2011). A Chaos Based Approach for Improving Non Linearity in S Box Design of Symmetric Key Cryptosystems. In: Meghanathan, N., Kaushik, B.K., Nagamalai, D. (eds) Advances in Networks and Communications. CCSIT 2011. Communications in Computer and Information Science, vol 132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17878-8_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-17878-8_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17877-1
Online ISBN: 978-3-642-17878-8
eBook Packages: Computer ScienceComputer Science (R0)