We discuss the problem of counting the number of primitive transformation shift registers and its equivalent formulation in terms of Singer cycles in a corresponding general linear group. We also introduce the notion of word-oriented nonlinearly filtered primitive transformation shift registers based on a Langford arrangement and study their linear complexity.

Additional Metadata
Keywords Langford arrangement, linear complexity, Linear feedback shift register, nonlinearly filtered primitive transformation shift register, Singer cycle, transformation shift register
Persistent URL dx.doi.org/10.1007/978-3-642-30615-0_18
Series Lecture Notes in Computer Science
Citation
Hasan, S.U. (Sartaj Ul), Panario, D. (Daniel), & Wang, Q. (2012). Word-oriented transformation shift registers and their linear complexity. In Lecture Notes in Computer Science. doi:10.1007/978-3-642-30615-0_18