Finding Matching Initial States for Equivalent NLFSRs in the Fibonacci and the Galois Configurations

The Fibonacci and the Galois configurations of nonlinear feedback shift registers (NLFSRs) are considered. In the former, the feedback is applied to the input bit of the shift register only. In the latter, the feedback can potentially be applied to every bit. The sufficient conditions for equivalence of NLFSRs in the Fibonacci and the Galois configurations have been formulated previously. The equivalent NLFSRs in different configurations normally have to be initialized to different states to generate the same output sequences. The mapping between the initial states of two equivalent NLFSRs in the Fibonacci and the Galois configurations is derived in this paper.

[1]  Hannu Tenhunen,et al.  On Analysis and Synthesis of (n,k)-Non-Linear Feedback Shift Registers , 2008, 2008 Design, Automation and Test in Europe.

[2]  Martin Hell,et al.  The Grain Family of Stream Ciphers , 2008, The eSTREAM Finalists.

[3]  Matthew J. B. Robshaw,et al.  New Stream Cipher Designs: The eSTREAM Finalists , 2008 .

[4]  Martin Hell,et al.  Grain: a stream cipher for constrained environments , 2007, Int. J. Wirel. Mob. Comput..

[5]  Ari Juels,et al.  RFID security and privacy: a research survey , 2006, IEEE Journal on Selected Areas in Communications.

[6]  Anne Canteaut,et al.  Open Problems Related to Algebraic Attacks on Stream Ciphers , 2005, WCC.

[7]  Benjamin Gittins,et al.  A Presentation on VEST Hardware Performance, Chip Area Measurements, Power Consumption Estimates and Benchmarking in Relation to the AES, SHA-256 and SHA-512 , 2005, IACR Cryptol. ePrint Arch..

[8]  Janusz Rajski,et al.  Ring generators - new devices for embedded test applications , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Oliver Kniffler,et al.  Achterbahn-128 / 80 : Design and Analysis , 2007 .

[10]  Nicholas Kalouptsidis,et al.  Synthesis of minimal cost nonlinear feedback shift registers , 2002, 2002 11th European Signal Processing Conference.

[11]  B. Preneel,et al.  Trivium Specifications ? , 2022 .

[12]  Elena Dubrova.  An equivalence preserving transformation from the Fibonacci to the Galois NLFSRs , 2008, ArXiv.

[13]  Christian Ronse.  Feedback Shift Registers , 1984, Lecture Notes in Computer Science.

[14]  Rainer Göttfert,et al.  An NLFSR-based stream cipher , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[15]  Dimitrios Kagaris.  A similarity transform for linear finite state machines , 2006, Discret. Appl. Math..

[16]  William Millan,et al.  Dragon: A Fast Word Based Stream Cipher , 2004, ICISC.

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

[18]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[19]  Ruey-Wen Liu,et al.  Equivalence of nonlinear shift-registers , 1964, IEEE Trans. Inf. Theory.

[20]  Hu Chuan-Gan,et al.  On The Shift Register Sequences , 2004 .

[21]  W. W. Peterson,et al.  Error-Correcting Codes. , 1962 .

[22]  F. Lemmermeyer.  Error-correcting Codes , 2005 .

[23]  Mark Goresky,et al.  Fibonacci and Galois representations of feedback-with-carry shift registers , 2002, IEEE Trans. Inf. Theory.

[24]  Melvin A. Breuer,et al.  Digital systems testing and testable design , 1990 .

[25]  Bruce Schneier,et al.  Applied cryptography (2nd ed.): protocols, algorithms, and source code in C , 1995 .

[26]  Fred Piper,et al.  Stream Ciphers , 1982, EUROCRYPT.

[27]  H. Fredricksen.  A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .

[28]  Matthew J. B. Robshaw,et al.  The eSTREAM Project , 2008, The eSTREAM Finalists.

[29]  C.J.A. Jansen,et al.  Investigations on nonlinear streamcipher systems: construction and evaluation methods , 1989 .

[30]  J. Stokłosa,et al.  Boolean feedback functions for full-length nonlinear shift registers , 2004 .