Counting functions and expected values for the \(k\)-error linear complexity

DOI10.1006/ffta.2001.0326zbMath1008.94016OpenAlexW2053521002MaRDI QIDQ1609392

Harald Niederreiter, Wilfried Meidl

Publication date: 15 August 2002

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.2001.0326

zbMATH Keywords

stream ciphersupper and lower boundslinear complexity\(k\)-error linear complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (10)

Error linear complexity measures for multisequences ⋮ Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences ⋮ Expected π-Adic Security Measures of Sequences ⋮ On the k-Operation Linear Complexity of Periodic Sequences ⋮ An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ Lower bounds on error complexity measures for periodic LFSR and FCSR sequences ⋮ Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity ⋮ Counting functions and expected values for the lattice profile at \(n\) ⋮ The expectation and variance of the joint linear complexity of random periodic multisequences

Cites Work

• Analysis and design of stream ciphers
• The stability theory of stream ciphers
• Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Shift-register synthesis and BCH decoding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting functions and expected values for the \(k\)-error linear complexity