An improved transformation between Fibonacci FSRs and Galois FSRs

Feedback shift registers (FSRs), which have two configurations: Fibonacci and Galois, are a primitive building block in stream ciphers. In this paper, an improved transformation is proposed between Fibonacci FSRs and Galois FSRs. In the previous results, the number of stages is identical when constructing the equivalent FSRs. In this paper, there is no requirement to keep the number of stages equal for two equivalent FSRs here. More precisely, it is verified that an equivalent Galois FSR with fewer stages cannot be found for a Fibonacci FSR, but the converse is not true. Furthermore, the total number of equivalent Galois FSRs for a given Fibonacci FSR with n stages is calculated. In order to reduce the propagation time and memory, an effective algorithm is developed to find equivalent Galois FSR and is proved to own minimal operators and stages. Finally, the feasibility of our proposed strategies, to mutually transform Fibonacci FSRs and Galois FSRs, is demonstrated by numerical examples.

[1]  Elena Dubrova.  Synthesis of Binary Machines , 2011, IEEE Transactions on Information Theory.

[2]  Gang Feng,et al.  Stability and $l_1$ Gain Analysis of Boolean Networks With Markovian Jump Parameters , 2017, IEEE Transactions on Automatic Control.

[3]  Jinde Cao,et al.  On the ensemble controllability of Boolean control networks using STP method , 2019, Appl. Math. Comput..

[4]  Dongdai Lin,et al.  A new linearization method for nonlinear feedback shift registers , 2015, J. Comput. Syst. Sci..

[5]  Yuzhen Wang,et al.  Lyapunov-Based Stability and Construction of Lyapunov Functions for Boolean Networks , 2017, SIAM J. Control. Optim..

[6]  James Lam,et al.  Stability and Guaranteed Cost Analysis of Time-Triggered Boolean Networks , 2018, IEEE Transactions on Neural Networks and Learning Systems.

[7]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[8]  Wen-Feng Qi,et al.  Further Results on the Decomposition of an NFSR Into the Cascade Connection of an NFSR Into an LFSR , 2015, IEEE Trans. Inf. Theory.

[9]  Elena Dubrova.  An Equivalence-Preserving Transformation of Shift Registers , 2014, SETA.

[10]  Tielong Shen,et al.  A Finite Convergence Criterion for the Discounted Optimal Control of Stochastic Logical Networks , 2018, IEEE Transactions on Automatic Control.

[11]  Yuqian Guo,et al.  Observability of Boolean Control Networks Using Parallel Extension and Set Reachability , 2018, IEEE Transactions on Neural Networks and Learning Systems.

[12]  Michael Margaliot,et al.  Controllability of Boolean control networks via the Perron-Frobenius theory , 2012, Autom..

[13]  Pantelimon Stanica,et al.  Cryptographic Boolean Functions and Applications , 2009 .

[14]  Abdulah Abdulah Zadeh,et al.  Simple power analysis applied to nonlinear feedback shift registers , 2014, IET Inf. Secur..

[15]  Nicholas Kolokotronis,et al.  On the Nonlinear Complexity and Lempel–Ziv Complexity of Finite Length Sequences , 2007, IEEE Transactions on Information Theory.

[16]  M. Margaliot.  Controllability and observability of Boolean control networks , 2012 .

[17]  Martin Hell,et al.  Espresso: A stream cipher for 5G wireless communication systems , 2015, Cryptography and Communications.

[18]  Daizhan Cheng,et al.  Block Decoupling of Boolean Control Networks , 2019, IEEE Transactions on Automatic Control.

[19]  Lin Zhiqiang,et al.  The Transformation from the Galois NLFSR to the Fibonacci Configuration , 2013, 2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies.

[20]  R. Gold,et al.  Optimal binary sequences for spread spectrum multiplexing (Corresp.) , 1967, IEEE Trans. Inf. Theory.

[21]  Daizhan Cheng,et al.  Analysis and Control of Boolean Networks , 2011 .

[22]  Elena Dubrova,et al.  Finding Matching Initial States for Equivalent NLFSRs in the Fibonacci and the Galois Configurations , 2009, IEEE Transactions on Information Theory.

[23]  Dongdai Lin,et al.  Lower and Upper Bounds on the Density of Irreducible NFSRs , 2018, IEEE Transactions on Information Theory.

[24]  Jovan Dj. Golic.  On the Security of Nonlinear Filter Generators , 1996, FSE.

[25]  S. Kauffman.  Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

[26]  Michael Margaliot,et al.  Mathematical modeling of the lambda switch: a fuzzy logic approach. , 2009, Journal of theoretical biology.

[27]  Yang Liu,et al.  Nonsingularity of Grain-like cascade FSRs via semi-tensor product , 2017, Science China Information Sciences.

[28]  Kuize Zhang,et al.  Observability of Boolean control networks: A unified approach based on the theories of finite automata and formal languages , 2014, CCC 2014.

[29]  Elena Dubrova,et al.  A Transformation From the Fibonacci to the Galois NLFSRs , 2009, IEEE Transactions on Information Theory.

[30]  Jinde Cao,et al.  The transformation between the Galois NLFSRs and the Fibonacci NLFSRs via semi-tensor product of matrices , 2018, Autom..

[31]  Zheng-Guang Wu,et al.  Set Stabilization of Probabilistic Boolean Control Networks: A Sampled-Data Control Approach , 2020, IEEE Transactions on Cybernetics.

[32]  Jinde Cao,et al.  Observability of Boolean control networks , 2018, Science China Information Sciences.

[33]  Dongdai Lin,et al.  On Minimum Period of Nonlinear Feedback Shift Registers in Grain-Like Structure , 2018, IEEE Transactions on Information Theory.

[34]  Edward McCluskey,et al.  Built-In Self-Test Techniques , 1985, IEEE Design & Test of Computers.

[35]  Jinde Cao,et al.  Stability and Stabilization in Probability of Probabilistic Boolean Networks , 2021, IEEE Transactions on Neural Networks and Learning Systems.