Abstract
Finding a recurrence of a shift register gives its equivalent shift register in Fibonacci configuration and hence helps to decide whether different nonlinear shift registers are equivalent, i.e., whether they generate the same set of output sequences. We define a dependence graph of a shift register and it is a directed acyclic graph related to the shift register. We show that existence of a dependence graph with a special property of a nonlinear shift register ensures existence of a short recurrence of the sequence generated by the nonlinear shift register. We also present an algorithm to search dependence graphs of a nonlinear shift register.
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
Adriansyah, A., van Dongen, B.F., van der Aalst, W.M.P.: Towards Robust Conformance Checking. In: zur Muehlen, M., Su, J. (eds.) BPM 2010 Workshops. LNBIP, vol. 66, pp. 122–133. Springer, Heidelberg (2011)
Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer (2008)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
De Cannière, C., Preneel, B.: Trivium: a Stream Cipher Construction Inspired by Block Cipher Design Principles. eSTREAM, ECRYPT Stream Cipher Project, Report 2006/021, http://www.ecrypt.eu.org/stream/papersdir/2006/021
De Cannière, C., Preneel, B.: Trivium. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 244–266. Springer, Heidelberg (2008)
Chabloz, J., Mansouri, S.S., Dubrova, E.: An Algorithm for Constructing a Fastest Galois NLFSR Generating a Given Sequence. In: Carlet, C., Pott, A. (eds.) SETA 2010. LNCS, vol. 6338, pp. 41–54. Springer, Heidelberg (2010)
Daemen, J., Rijmen, V.: The Design of Rijindael: AES - the Advanced Encryption Standard. Springer (2001)
Dubrova, E.: A Transformation from the Fibonacci to the Galois NLFSRs. IEEE Transactions on Information Theory 55(11), 5263–5271 (2009)
Foulds, L.R.: Graph Theory Applications. Springer (1992)
Golić, J.D.: Modes of Operation of Stream Ciphers. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 233–247. Springer, Heidelberg (2001)
Golomb, S.: Shift Register Sequences. Aegean Park Press, Walnut Creek (1982)
Russell, S.J., Norvis, P.: Artificial Intelligence: a Modern Approach. Prentice Hall, Inc. (1995)
Wan, Z.X., Dai, Z.D., Liu, M.L., Feng, X.N.: Nonlinear Shift Registers. Science Press (1978) (in Chinese)
Wan, Z.X.: Algebra and Codes. Science Press (1980) (in Chinese)
Data Assurance & Communication Security Center, Chinese Science Academy, 3GPP Confidentiality and Integrity Algorithms 128-EEA3 & 128-EIA3, http://zucalg.forumotion.net/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, L., Shen, B., Qiao, T. (2012). Searching Short Recurrences of Nonlinear Shift Registers via Directed Acyclic Graphs. In: Wu, CK., Yung, M., Lin, D. (eds) Information Security and Cryptology. Inscrypt 2011. Lecture Notes in Computer Science, vol 7537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34704-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-34704-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34703-0
Online ISBN: 978-3-642-34704-7
eBook Packages: Computer ScienceComputer Science (R0)