Abstract
In a stream cipher the plaintext digits are encrypted one at a time, and the transformation of successive digits varies during the encryption. LFSRs produce sequences having large periods and good statistical properties, and are readily analyzed using algebraic techniques. But the output sequences of LFSRs are also easily predictable, if we know proper successive output sequences in output sequences. In this paper, we give a new method which generates nonlinear sequences using maximum-length cellular automata.
This work was supported by the Korea Research Foundation Grant funded by the Korean Government(MOEHRD)(KRF-2006-331-D00458).
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
Preview
Unable to display preview. Download preview PDF.
References
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)
Sabater, A.F., Martinez, D.G.: Modelling nonlinear sequence generators in terms of linear cellular automata. Applied Mathematical Modelling 31, 226–235 (2007)
Cho, S.J., Choi, U.S., Hwang, Y.H., Pyo, Y.S., Kim, H.D., Kim, K.S., Heo, S.H.: Computing phase shifts of maximum-length 90/150 cellular automata sequences. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 31–39. Springer, Heidelberg (2004)
Cho, S.J., Choi, U.S., Kim, H.D., Hwang, Y.H., Kim, J.G., Heo, S.H.: New synthesis of one-dimensional 90/150 linear hybrid group cellular automata. IEEE Trans. Comput-Aided Des. Integr. Circuits Syst. 26-9, 1720–1724 (2007)
Gong, G.: Theory and applications of q-ary interleaved sequences. IEEE Transaction on Information Theory 41-2, 400–411 (1995)
Das, A.K., Chaudhuri, P.P.: Vector space theoretic analysis of additive cellular automata and its application for pseudo-exhaustive test pattern generation. IEEE Trans. Comput. 42, 340–352 (1993)
Tsalides, P., York, T.A., Thanailakis, A.: Pseudorandom number generators for systems based on linear cellular automata. IEE Proc(Part E) Computers Digital Techniques 138, 241–249 (1991)
Sarkar, P.: Computing Shifts in 90/150 cellular automata sequences. Finite Fields Their Appl. 42, 340–352 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, US., Cho, SJ., Kim, HD., Hwang, YH., Kim, S. (2008). Nonlinear Pseudorandom Sequences Based on 90/150 LHGCA . In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds) Cellular Automata. ACRI 2008. Lecture Notes in Computer Science, vol 5191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79992-4_61
Download citation
DOI: https://doi.org/10.1007/978-3-540-79992-4_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79991-7
Online ISBN: 978-3-540-79992-4
eBook Packages: Computer ScienceComputer Science (R0)