New upper bounds on the linear complexity

DOI10.1016/S0898-1221(99)00331-4MaRDI QIDQ1570119zbMATH OpenWikidataFDO

Authors Pino Caballero-Gil

Publication date 2000

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

CryptographyLinear complexityCyclotomic cosetKey stream generatorNonlinear filter function

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 1740036
• Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
• scientific article; zbMATH DE number 1024087
• scientific article; zbMATH DE number 825180
• On the linear complexity parameter and second order nonlinear filters.

Cites work

• scientific article; zbMATH DE number 177032 (Why is no real title available?)
• scientific article; zbMATH DE number 177033 (Why is no real title available?)
• scientific article; zbMATH DE number 1024087 (Why is no real title available?)
• An analysis of the structure and complexity of nonlinear binary sequence generators
• Linear Complexity and Random Sequences
• On Certain Nonlinear Recurring Sequences
• Shift-register synthesis and BCH decoding
• The stability theory of stream ciphers

Cited in

(7)

• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
• scientific article; zbMATH DE number 7650076 (Why is no real title available?)
• scientific article; zbMATH DE number 1740036 (Why is no real title available?)
• An upper bound for the linearity of exponential Welch-Costas functions
• New Bounds on the Capacity of Multidimensional Run-Length Constraints
• Analysis of the upper bound on the complexity of LLL algorithm
• scientific article; zbMATH DE number 825180 (Why is no real title available?)

This page was built for publication: New upper bounds on the linear complexity

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