The expectation and variance of the joint linear complexity of random periodic multisequences

DOI10.1016/j.jco.2005.07.001zbMath1092.94022MaRDI QIDQ2577529

Ming Su, Fang-Wei Fu, Harald Niederreiter

Publication date: 22 December 2005

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2005.07.001

zbMATH Keywords

stream ciphers; variance; expectation; multisequences; joint linear complexity; generalized discrete Fourier transform

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

60C05: Combinatorial probability

11B50: Sequences (mod (m))

Related Items

Linear difference equations and periodic sequences over finite fields, Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields, Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences, The asymptotic behavior of the joint linear complexity profile of multisequences, Error linear complexity measures for multisequences, Periodic multisequences with large error linear complexity, Joint linear complexity of multisequences consisting of linear recurring sequences, Lower bounds on error complexity measures for periodic LFSR and FCSR sequences, How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences, The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\), On the counting function of the lattice profile of periodic sequences, PERIODS ON TWO KINDS OF NONLINEAR FEEDBACK SHIFT REGISTERS WITH TIME VARYING FEEDBACK FUNCTIONS, Generalized Joint Linear Complexity of Linear Recurring Multisequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extension of the Berlekamp-Massey algorithm to N dimensions
• Enumeration results on the joint linear complexity of multisequences
• The stability theory of stream ciphers
• The expected value of the joint linear complexity of periodic multisequences
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• Counting functions and expected values for the \(k\)-error linear complexity
• On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• Linear Complexity of Periodic Sequences: A General Theory
• Linear Complexity and Random Sequences
• A generalized Euclidean algorithm for multisequence shift-register synthesis
• Linear Complexity of Periodically Repeated Random Sequences
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• Progress in Cryptology - INDOCRYPT 2003
• Multisequences with almost perfect linear complexity profile and function fields over finite fields