On Equivalence of Cascade Connections of Two Nonlinear Feedback Shift Registers

Abstract

Grain is a hardware-oriented finalist in the eSTREAM Stream Cipher Project. As a particular Galois nonlinear feedback shift register (NFSR), cascade connection of two NFSRs has been used as the main building block in the Grain family of stream ciphers. Two NFSRs are said to be equivalent if their sets of output sequences are equal. Finding properties of equivalent cascade connections of two NFSRs is useful to the design of the Grain family of stream ciphers. This paper first gives some properties of feedback functions between equivalent cascade connections of two NFSRs. It then shows that a cascade connection of two NFSRs and its equivalent Galois NFSR have isomorphic state diagrams if they have the same stage number. Finally, the paper reveals that for any given cascade connection of an $m$-stage NFSR1 into an $n$-stage NFSR2, there is only another one equivalent cascade connection of an $m$-stage NFSR3 into an $n$-stage NFSR4; moreover, the feedback functions of NFSR1 and NFSR3 are dual complementary, and the feedback functions of NFSR2 and NFSR4 are complementary. As an application of this property, the paper shows that the existing Grain family of stream ciphers have used the ones with lower cost of hardware implementations between their own two equivalent cascade connections, confirming their good design criteria.

Deciding Irreducibility/Indecomposability of Feedback Shift Registers Is NP-Hard

“…Instead of considering general decomposition, a practical algorithm has been proposed to find * -factors for the special case FSRðhÞ: ¼ FSRðgÞ: * FSRðgÞ: [18]. Zhong and Lin [19] gave strong results on uniqueness of cascade decomposition FSRð f Þ: * FSRðgÞ: . Additionally, the periods of sequences generated by the grain-like structures are studied [20][21][22][23][24].…”

Research Status of Nonlinear Feedback Shift Register Based on Semi-Tensor Product

“…Stream cipher design can benefit from examining the features of two equivalent cascade NFSRs, for example, to choose a better NFSR based on its quality metrics [69] showed that for any given cascade connection of an m-stage NFSR1 into an n-stage NFSR2, there exists only another one equivalent cascade connection of an m-stage NFSR3 into an n-stage NFSR4.…”

“…These results are more novel than previous conclusions and are very helpful for the design of practical stream cipher algorithms and decoding algorithms. According to the specific research object, the main achievements can be roughly divided into the modeling of NFSRs [65][66][67], the analysis of the structure of NFSRs [68][69][70][71][72][73][74][75][76][77][78][79][80][81], and the study of the properties of NFSRs [82][83][84][85][86][87][88][89][90][91][92][93][94][95][96][97]. This paper will give an overview of the latest achievements in NFSR research based on STP from these three aspects.…”