Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators

DOI10.1007/978-3-540-79499-8_20MaRDI QIDQ3600338zbMATH OpenOpenAlexFDO

Authors Konstantinos Limniotis, Nicholas Kolokotronis, N. Kalouptsidis

Publication date 10 February 2009

Published in Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79499-8_20

zbMATH Keywords

binary sequencesfilter functionslinear complexitylinear feedback shift registerslinearized polynomialsstream ciphers

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Factorization of determinants over finite fields and application in stream ciphers
• scientific article; zbMATH DE number 1024087
• On the linear complexity of nonlinearly filtered pn-sequences
• Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants
• scientific article; zbMATH DE number 1740036

Cites work

• A New Attack on the Filter Generator
• Algebraic coding theory
• An analysis of the structure and complexity of nonlinear binary sequence generators
• Analysis and design of stream ciphers
• Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators
• Generation of binary sequences with controllable complexity
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• scientific article; zbMATH DE number 3422259 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants
• On the linear complexity of functions of periodic GF(q) sequences
• On the linear complexity of nonlinearly filtered pn-sequences
• On the linear complexity of the sequences generated by nonlinear filterings
• On the minimal polynomial of the product of linear recurring sequences
• Root counting, the DFT and the linear complexity of nonlinear filtering
• Shift-register synthesis and BCH decoding

Cited in

(6)

• Factorization of determinants over finite fields and application in stream ciphers
• New upper bounds on the linear complexity
• Comments on L. J. García-Villalba and M. C. Rodríguez-Palánquex, A family of keystream generators with large linear complexity, Appl. Math. Lett. 14, No.5, 545-547 (2001; Zbl 0995.94031)
• Global linear complexity analysis of filter keystream generators
• Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants
• scientific article; zbMATH DE number 1740036 (Why is no real title available?)

This page was built for publication: Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators

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