Word-Oriented Transformation Shift Registers and Their Linear Complexity

  • Sartaj Ul Hasan
  • Daniel Panario
  • Qiang Wang
Conference paper

DOI: 10.1007/978-3-642-30615-0_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7280)
Cite this paper as:
Hasan S.U., Panario D., Wang Q. (2012) Word-Oriented Transformation Shift Registers and Their Linear Complexity. In: Helleseth T., Jedwab J. (eds) Sequences and Their Applications – SETA 2012. SETA 2012. Lecture Notes in Computer Science, vol 7280. Springer, Berlin, Heidelberg

Abstract

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.

Keywords

Linear feedback shift register Singer cycle transformation shift register linear complexity Langford arrangement nonlinearly filtered primitive transformation shift register 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Sartaj Ul Hasan
    • 1
  • Daniel Panario
    • 1
  • Qiang Wang
    • 1
  1. 1.School of Mathematics and StatisticsCarleton UniversityOttawaCanada

Personalised recommendations