Asymptotic analysis on the normalized k-error linear complexity of binary sequences

DOI10.1007/S10623-011-9519-8MaRDI QIDQ664386zbMATH OpenOpenAlexFDO

Authors Lin Tan, Wenfeng Qi, Hong Xu

Publication date 1 March 2012

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-011-9519-8

zbMATH Keywords

binary sequenceslinear complexitystream ciphers\(k\)-error linear complexity

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50)

Recommendations

• The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
• Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences
• Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
• Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences
• On the \(k\)-error linear complexity of \(\ell\)-sequences
• On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences
• Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences
• An algorithm for the \(k\)-error linear complexity of binary sequences with period \(2p^m\)

Cites work

• scientific article; zbMATH DE number 1250549 (Why is no real title available?)
• scientific article; zbMATH DE number 1740050 (Why is no real title available?)
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Analysis and design of stream ciphers
• Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
• Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
• Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences
• Counting functions and expected values for the \(k\)-error linear complexity
• Progress in Cryptology - INDOCRYPT 2003
• The asymptotic behavior of \(N\)-adic complexity
• The asymptotic normalized linear complexity of multisequences
• The stability theory of stream ciphers

Cited in

(6)

• Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
• On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
• The asymptotic behavior of \(N\)-adic complexity
• A complexity measure for families of binary sequences
• Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences
• The asymptotic behavior of the joint linear complexity profile of multisequences

This page was built for publication: Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q664386)