Abstract
The shortage of original Camellia key generation and expansion strategy was researched. Based on these researches, the new Camellia key expansion algorithms are proposed. In this algorithms, Logistic mapping is used to reduce the dependence between subkeys. Experimental result shows that the security and robustness of the AES subkeys have been strengthened.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai, S., Nakajima, J., Tokita, T.: Specification of Camellia – A 128-bit Block Cipher. Nippon Telegraphy and Telephone Corporation, Mitsubishi Electric Corporation, July 2000
Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai, S., Nakajima, J., Tokita, T.: Camellia: a 128-bit block cipher suitable for multiple platforms - design and analysis. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 39–56. Springer, Heidelberg (2001)
Zhou, Y., Wu, W., Xu, N., Feng, D.: Differential fault attack on camellia. Chin. J. Electron. 18(1), 13–19 (2009)
Kocarev, L., Jakimoski, G., Stojanovski, T., Parlitz, U.: From chaotic maps to encryption schemes. In: Proceedings of IEEE International Symposium on Circuits and Systems 1998, vol. 4, pp. 514–517. IEEE (1998)
Zhou, H., Ling, X.T.: Generating chaotic secure sequences with desired statistical properties and high security. Int. J. Bifurcation Chaos 7(1), 205–213 (1997)
Li, S.J.: Analyses and new designs of digital chaotic ciphers. Ph.D. thesis, School of Electronics and Information Engineering. Xi’an Jiaotong University, Xi’an (2003). http://www.hooklee.com/pub.html
Li, C.Y., Chen, J.S., Chang, T.Y.: A chaos-based pseudo random number generator using timing-based reseeding method. In: IEEE Proceedings of ISCAS, pp. 21–24 (2006)
Hatano, Y., Sekine, H., Kaneko, T.: Higher order differential attack of camellia (II). In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 39–56. Springer, Heidelberg (2003)
Shirai, T., Kanamaru, S., Abe, G.: Improved upper bounds of differential and linear characteristic probability for camellia. In: Daemen, J., Rijmen, V. (eds.) FSE 2002. LNCS, vol. 2365, pp. 128–142. Springer, Heidelberg (2002)
Zhang, L., Zhang, Y.: Research on lorenz chaotic stream cipher. In: IEEE International Workshop VLSI Design & Video Tech, pp. 431–434 (2005)
Lu, J., Kim, J.-S., Keller, N., Dunkelman, O.: Improving the efficiency of impossible differential cryptanalysis of reduced camellia and MISTY1. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 370–386. Springer, Heidelberg (2008)
Addabbo, T., Alioto, M., Fort, A., Pasini, A., Rocchi, S., Vignoli, V.: A class of maximum-period nonlinear congruential generators derived from the Rényi chaotic map. IEEE Trans. Circuits Syst. I 54(4), 816–828 (2007)
Li, G., Wang, Y., Ma, H.: Audio packet encryption of flow control base on stop-and-wait protocol. J. Inf. Hiding Multimed. Signal Process. 7(1), 127–134 (2016)
Zhen, J., Zhifang, W., Zhao, B., Tang, L.: A novel super-resolution direction finding method for wideband signals based on multiple small aperture subarrays. J. Inf. Hiding Multimed. Signal Process. 7(3), 510–520 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Wang, C., Ding, Q. (2017). Camellia Key Expansion Algorithm Based on Chaos. In: Pan, JS., Snášel, V., Sung, TW., Wang, X. (eds) Intelligent Data Analysis and Applications. ECC 2016. Advances in Intelligent Systems and Computing, vol 535. Springer, Cham. https://doi.org/10.1007/978-3-319-48499-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-48499-0_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48498-3
Online ISBN: 978-3-319-48499-0
eBook Packages: EngineeringEngineering (R0)