Construction of Transition Matrices for Binary FCSRs

Stream ciphers based on Linear Feedback Shift Registers (LFSRs) have faced algebraic attacks. To avoid this kind of attacks, Feedback with Carry Shift Registers (FCSRs) have been proposed as an alternative. In order to eliminate a so-called LFSRization weakness, FCSRs have been implemented using ring representation instead of the Galois one. A ring FCSR is determined by its transition matrix A. Its connection integer, which is related to the properties of the output sequences, is q = det(I − 2A). In this paper, we show how to calculate the determinant det(I − 2A) of transition matrices with a critical path of length 1 and fan-out 2. Moreover, we propose algorithms to construct such transition matrices (binary case) based on searching target connection integers.

[1]  Andrew Klapper,et al.  A Survey of Feedback with Carry Shift Registers , 2004, SETA.

[2]  François Arnault,et al.  A matrix approach for FCSR automata , 2010, Cryptography and Communications.

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

[4]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[5]  Mark Goresky,et al.  2-Adic Shift Registers , 1993, FSE.

[6]  Martin Hell,et al.  Breaking the Stream Ciphers F-FCSR-H and F-FCSR-16 in Real Time , 2009, Journal of Cryptology.

[7]  Wen-Feng Qi,et al.  Linearity properties of binary FCSR sequences , 2009, Des. Codes Cryptogr..

[8]  Dongdai Lin,et al.  On the LFSRization of a Class of FCSR Automata , 2015, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences.

[9]  Lin Zhiqiang,et al.  Constructing a Ternary FCSR with a Given Connection Integer , 2012 .

[10]  Zhiqiang Lin,et al.  Construction of Transition Matrices for Ternary Ring Feedback With Carry Shift Registers , 2015, IEEE Transactions on Information Theory.

[11]  Hui Wang,et al.  A generalized birthday approach for efficiently finding linear relations in $$\ell $$ℓ-sequences , 2015, Des. Codes Cryptogr..

[12]  Mark Goresky,et al.  Feedback shift registers, 2-adic span, and combiners with memory , 1997, Journal of Cryptology.

[13]  François Arnault,et al.  F-FCSR: Design of a New Class of Stream Ciphers , 2005, FSE.

[14]  Thierry P. Berger,et al.  Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode , 2009, INDOCRYPT.

[15]  Martin Hell,et al.  An Efficient State Recovery Attack on the X-FCSR Family of Stream Ciphers , 2012, Journal of Cryptology.

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

[17]  François Arnault,et al.  A New Approach for FCSRs , 2009, Selected Areas in Cryptography.