Abstract
Nonlinear feedback shift registers (NFSRs) are used in many stream ciphers as their main building blocks. According to implementation configurations, NFSRs are generally classified as Fibonacci NFSRs and Galois NFSRs. Compared to Fibonacci NFSRs, Galois NFSRs have potentially shorter propagation time and higher throughput. Moreover, if a Galois NFSR is equivalent to a Fibonacci NFSR in the sense that they have the same set of output sequences, then this particular Galois NFSR can overcome some drawbacks of a general one, and therefore may improve the security of NFSR-based stream ciphers. Previous work has found some types of Galois NFSRs equivalent to Fibonacci NFSRs, and has shown many Galois NFSRs equivalent to a given Fibonacci NFSR with the same stage number. This paper gives another type of Galois NFSRs equivalent to a given Fibonacci NFSR, in which their all corresponding states have either equal or complementary components at the same positions. As an application of this result, the paper shows that the stream ciphers Grain, Trivium and Acorn have used the NFSRs with the lowest cost of hardware implementation among their own equivalent Galois NFSRs of this type. The paper also enumerates the Galois NFSRs equivalent to a given Fibonacci NFSR with the same stage number. Moreover, it reveals some common characterizations of Galois NFSRs that are equivalent to Fibonacci ones from the perspectives of their stage number and feedback functions, helpful to the design of stream ciphers.
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
Hell M., Johansson T., Meier W.: Grain-a stream cipher for constrained environments. eSTREAM, ECRYPT Stream Cipher Project, London, U.K., Technical report, 2005/010 (2005)
Cannière De C., Preneel B.: Trivium Specifications. eSTREAM, ECRYPT Stream Cipher Project, London, U.K., Technical report, 2005/030 (2005)
Wu, H.: ACORN: A lightweight authenticated cipher (v3). Submission to CAESAR (2016). http://competitions.cr.yp.to/round3/acornv3.pdf
Dubrova, E.: A transformation from the Fibonacci to the Galois NLFSRs. IEEE Trans. Inf. Theory 55(11), 5263–5271 (2009)
Dubrova, E.: An equivalence-preserving transformation of shift registers. In: Schmidt, K.-U., Winterhof, A. (eds.) SETA 2014. LNCS, vol. 8865, pp. 187–199. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-12325-7_16
Zhong, J.: On equivalence of cascade connections of two nonlinear feedback shift registers. Comput. J. 62(12), 1793–1804 (2019)
Dubrova, E.: Finding matching initial states for equivalent NLFSRs in the Fibonacci and the Galois configurations. IEEE Trans. Inf. Theory 56(6), 2961–2966 (2010)
Lin Z.: The transformation from the Galois NLFSR to the Fibonacci configuration. In: EI-DWT 2013, pp. 335–339. IEEE Press, Piscataway (2013)
Mykkeltveit, J., Siu, M.-K., Ton, P.: On the cylcle structure of some nonlinear shift register sequences. Inf. Control 43, 202–215 (1979)
Cheng, D., Qi, H., Li, Z.: Analysis and Control of Boolean Networks. Springer, London (2011). https://doi.org/10.1007/978-0-85729-097-7
Cheng, D., Qi, H., Zhao, Y.: An Introduction to Semi-Tensor Product of Matrices and Its Applications. World Scientific Publishing Company, Singapore (2012)
Zhao, D.W., Peng, H.P., Li, L.X., Hui, S.L., Yang, Y.X.: Novel way to research nonlinear feedback shift register. Sci. China Inf. Sci. 57(9), 1–14 (2014). https://doi.org/10.1007/s11432-013-5058-4
Zhong, J., Lin, D.: A new linearization method of nonlinear feedback shift registers. J. Comput. Syst. Sci. 81(4), 783–796 (2015)
Zhong, J., Lin, D.: Driven stability of nonlinear feedback shift registers. IEEE Trans. Commun. 64(6), 2274–2284 (2016)
Zhong, J., Lin, D.: On minimum period of nonlinear feedback shift registers in Grain-like structure. IEEE Trans. Inf. Theory 64(99), 6429–6442 (2018)
Qi, H., Cheng, D.: Logic and logic-based control. J. Control Theory Appl. 6(1), 123–133 (2008)
Barbier, M., Cheballah, H., Le Bars, J.-M.: On the computation of the M\(\ddot{o}\)bius transform. Theor. Comput. Sci. 809, 171–188 (2020)
Roger, A.H., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1991)
Golomb, S.W.: Shift Register Sequences. Holden-Day, Laguna Hills (1967)
Kalouptsidis, N., Limniotis, K.: Nonlinear span, minimal realizations of sequences over finite fields and de Brujin generators. In: ISITA 2004, pp. 794–799. IEEE Press, Piscataway (2004)
Zhong, J., Lin, D.: Decomposition of nonlinear feedback shift registers based on Boolean networks. Sci. China Inf. Sci. 62(3), 1–3 (2019). https://doi.org/10.1007/s11432-017-9460-4
Acknowledgments
This work was supported by the National Natural Science Foundation of China under Grant Nos. 61772029 and 61872359.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhong, J., Pan, Y., Lin, D. (2021). On Galois NFSRs Equivalent to Fibonacci Ones. In: Wu, Y., Yung, M. (eds) Information Security and Cryptology. Inscrypt 2020. Lecture Notes in Computer Science(), vol 12612. Springer, Cham. https://doi.org/10.1007/978-3-030-71852-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-030-71852-7_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-71851-0
Online ISBN: 978-3-030-71852-7
eBook Packages: Computer ScienceComputer Science (R0)