Abstract
The modified self-shrinking generator is a non-linear cryptographic sequence generator designed to be used in hardware implementations. In this work, the output sequence of such a generator is obtained as one of the output sequences of a linear model based on Cellular Automata. Although irregularly decimated generators have been conceived and designed as non-linear sequence generators, in practice they can be easy modelled in terms of simple linear structures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cardell, S.D., Fúster-Sabater, A.: Linear models for the self-shrinking generator based on CA. J. Cell. Automata 11(2–3), 195–211 (2016)
Coppersmith, D., Krawczyk, H., Mansour, Y.: The shrinking generator. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 22–39. Springer, Heidelberg (1994)
Das, S., RoyChowdhury, D.: Car30: a new scalable stream cipher with rule 30. Crypt. Commun. 5(2), 137–162 (2013)
eSTREAM: the ECRYPT Stream Cipher Project, ECRYPT II, eSTREAM portfolio. http://www.ecrypt.eu.org/stream/
Fúster-Sabater, A., Pazo-Robles, M.E., Caballero-Gil, P.: A simple linearization of the self-shrinking generator by means of cellular automata. Neural Netw. 23(3), 461–464 (2010)
Golomb, S.W.: Shift Register-Sequences. Aegean Park Press, Laguna Hill (1982)
Jose, J., Das, S., Chowdhury, D.R.: Inapplicability of fault attacks against trivium on a cellular automata based stream cipher. In: Wąs, J., Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2014. LNCS, vol. 8751, pp. 427–436. Springer, Heidelberg (2014)
Kanso, A.: Modified self-shrinking generator. Comput. Electr. Eng. 36(1), 993–1001 (2010)
Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15(1), 122–127 (1969)
Meier, W., Staffelbach, O.: The self-shrinking generator. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 205–214. Springer, Heidelberg (1995)
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Paar, C., Pelzl, J.: Understanding Cryptography. Springer, Heidelberg (2010)
Robshaw, M., Billet, O. (eds.): New Stream Cipher Designs. LNCS, vol. 4986. Springer, Heidelberg (2008)
Wolfram, S.: Cellular automata as models of complexity. Nature 311(5985), 419–424 (1984)
Acknowledgment
The work of the first author was supported by FAPESP with number of process 2015/07246-0. The work of the second author was supported by both Ministerio de Economía, Spain, under grant TIN2014-55325-C2-1-R (ProCriCiS), and Comunidad de Madrid, Spain, under grant S2013/ICE-3095-CM (CIBERDINE).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Cardell, S.D., Fúster-Sabater, A. (2016). Modelling the MSSG in Terms of Cellular Automata. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2016. ICCSA 2016. Lecture Notes in Computer Science(), vol 9786. Springer, Cham. https://doi.org/10.1007/978-3-319-42085-1_40
Download citation
DOI: https://doi.org/10.1007/978-3-319-42085-1_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42084-4
Online ISBN: 978-3-319-42085-1
eBook Packages: Computer ScienceComputer Science (R0)