A family of keystream generators with large linear complexity

DOI10.1016/S0893-9659(00)00191-9zbMath0995.94031MaRDI QIDQ5938956

M. C. Rodríguez-Palánquex, Luis Javier García Villalba

Publication date: 7 August 2001

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

cryptographykeystream generatorscorrelation attackslarge linear complexitypseudorandom sequence generatorsshift register

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Cites Work

• Unnamed Item
• Root counting, the DFT and the linear complexity of nonlinear filtering
• Bounds on the linear span of bent sequences
• Linear Complexity of Periodic Sequences: A General Theory
• Linear Complexity and Random Sequences
• An analysis of the structure and complexity of nonlinear binary sequence generators
• On the security of shift register based keystream generators
• Generation of binary sequences with controllable complexity

Related Items (4)

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) ⋮ Information Security and Cryptology ⋮ Unnamed Item ⋮ An efficient binary sequence generator with cryptographic applications

This page was built for publication: A family of keystream generators with large linear complexity