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

DOI10.1007/978-3-540-79499-8_20zbMath1166.94319OpenAlexW1557585880MaRDI QIDQ3600338

Konstantinos Limniotis, Nicholas Kolokotronis, Nicholas 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 sequencesstream cipherslinear complexitylinearized polynomialslinear feedback shift registersfilter functions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the linear complexity of the sequences generated by nonlinear filterings
• Analysis and design of stream ciphers
• Root counting, the DFT and the linear complexity of nonlinear filtering
• On the minimal polynomial of the product of linear recurring sequences
• Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants
• On the linear complexity of nonlinearly filtered pn-sequences
• A New Attack on the Filter Generator
• Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators
• On the linear complexity of functions of periodic GF(q) sequences
• An analysis of the structure and complexity of nonlinear binary sequence generators
• Shift-register synthesis and BCH decoding
• Generation of binary sequences with controllable complexity

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