Linear transformation shift registers
Michael Dewar, Daniel Panario · IEEE Transactions on Information Theory · 2003
In order to exploit word-oriented operations for linear-feedback shift registers (LFSRs), Tsaban and Vishne [2002] introduced the notion of linear transformation shift registers (TSRs). An implementation of their primitive TSR generating algorithm shows that the LFSR are paired for all transformations. We prove that the characteristic polynomials of a pair of LFSRs are either both irreducible or both reducible for all transformations. This allows some time improvement when finding primitive TSRs. The authors give a full enumeration of all primitive TSRs with transformations of order 8 and LFSRs of order 3, 4, 5, and 6.