Abstract
Over the years Cellular Automata (CA) have been getting importance as a better crypto-primitives in designing stream ciphers. Wolfram identified Rule 30 as a powerful nonlinear function for cryptographic applications. However, Rule 30 CA is vulnerable against Meier and Staffelbach (MS) attack. This paper analyzes maximum period nonlinear CA (M-NHCA) which is shown to be secure against MS attack. We present a new design construction of a stream cipher employing the maximum period nonlinear CA and linear CA in conjunction with a rotational symmetric bent function. The proposed cipher has also been analyzed in aspect of almost all the known attacks in particular, the fault attack against which most of the eStream candidates like Grain-128 are vulnerable.
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
Similar content being viewed by others
Notes
- 1.
Bent function possesses the highest possible nonlinearity.
References
Chaudhuri, P.P., Roy Chowdhury, D., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata: Theory and Applications. IEEE Computer Socity Press, Los Alamitos (1997)
Das, S., Roy Chowdhury, D.: CAR30: a new scalable stream cipher with rule 30. Crypt. Commun. 5(2), 137–162 (2013)
Ghosh, S., Sengupta, A., Saha, D., Chowdhury, D.R.: A scalable method for constructing non-linear cellular automata with period \(2^n-1\). In: Wąs, J., Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2014. LNCS, vol. 8751, pp. 65–74. Springer, Cham (2014). doi:10.1007/978-3-319-11520-7_8
Hell, M., Johansson, T., Maximov, A., Meier, W.: A stream cipher proposal: grain-128. In: 2006 IEEE International Symposium Information Theory, pp. 1614–1618 (2006)
Karmakar, S., Roy Chowdhury, D.: NOCAS: a nonlinear cellular automata based stream cipher. In: 17th International Workshop on Cellular Automata and Discrete Complex Systems, Automata 2011, Center for Mathematical Modeling, University of Chile, Santiago, Chile, November 21–23, 2011, pp. 135–146 (2011)
Meier, W., Staffelbach, O.: Analysis of pseudo random sequences generated by cellular automata. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 186–199. Springer, Heidelberg (1991). doi:10.1007/3-540-46416-6_17
Wolfram, S.: Cryptography with cellular automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986). doi:10.1007/3-540-39799-X_32
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Maiti, S., Ghosh, S., Chowdhury, D.R. (2017). On the Security of Designing a Cellular Automata Based Stream Cipher. In: Pieprzyk, J., Suriadi, S. (eds) Information Security and Privacy. ACISP 2017. Lecture Notes in Computer Science(), vol 10343. Springer, Cham. https://doi.org/10.1007/978-3-319-59870-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-59870-3_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59869-7
Online ISBN: 978-3-319-59870-3
eBook Packages: Computer ScienceComputer Science (R0)