Joint linear complexity of multisequences consisting of linear recurring sequences

DOI10.1007/s12095-007-0001-4zbMath1178.94176OpenAlexW2015993444MaRDI QIDQ1032485

Ferruh Özbudak, Harald Niederreiter, Fang-Wei Fu

Publication date: 26 October 2009

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-007-0001-4

zbMATH Keywords

linear recurring sequencescounting functiongenerating polynomialmultisequencesjoint linear complexity

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (5)

Spectra of a class of quadratic functions: average behaviour and counting functions ⋮ On the joint 2-adic complexity of binary multisequences ⋮ Idempotent and \(p\)-potent quadratic functions: distribution of nonlinearity and co-dimension ⋮ Generalized Joint Linear Complexity of Linear Recurring Multisequences ⋮ The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the joint linear complexity profile of explicit inversive multisequences
• Extension of the Berlekamp-Massey algorithm to N dimensions
• How many bits have to be changed to decrease the linear complexity?
• The asymptotic behavior of the joint linear complexity profile of multisequences
• Error linear complexity measures for multisequences
• Enumeration results on the joint linear complexity of multisequences
• Analysis and design of stream ciphers
• The stability theory of stream ciphers
• The expected value of the joint linear complexity of periodic multisequences
• Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• Counting functions and expected values for the \(k\)-error linear complexity
• Multi-sequences with \(d\)-perfect property
• Lattice structure and linear complexity of nonlinear pseudorandom numbers
• On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes
• On the counting function of the lattice profile of periodic sequences
• Counting functions and expected values for the lattice profile at \(n\)
• The expectation and variance of the joint linear complexity of random periodic multisequences
• 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
• The Probabilistic Theory of the Joint Linear Complexity of Multisequences
• The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
• On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
• A generalized Euclidean algorithm for multisequence shift-register synthesis
• Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• Progress in Cryptology - INDOCRYPT 2003
• Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
• Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
• Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
• Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Multisequences with almost perfect linear complexity profile and function fields over finite fields

This page was built for publication: Joint linear complexity of multisequences consisting of linear recurring sequences