Welcome to IOU Digital Library

This paper studies the linear complexity of sequences generated over residue rings, particularly the ring 𝑍 2 𝑒 Z 2 e ​ . Linear feedback shift registers (LFSRs) defined over these rings can be efficiently implemented on microprocessors and are useful for generating pseudorandom sequences. The authors analyze the binary sequences formed from the most significant bits of such sequences and establish lower bounds for their linear complexity over 𝐹 2 F 2 ​ . The work contributes to the theoretical understanding of pseudorandom sequence generation and its applications in cryptography and digital communications.

no reviews

245: $a: Lower Bounds for the Linear Complexity of Sequences over Residue Rings
245: $b:
082: $a:
100: $a: Zong-duo Dai, Thomas Beth & Dieter Gollmann
650: $a: Computer Science
250: $a:
440: $v:
250: $b: Springer Verlag
250: $c: 1998
020: $a:
300: $a: 7