On the Linear Complexity of Combined Shift Register Sequences

DOI10.1007/3-540-39805-8_19zbMath0593.94010OpenAlexW1524889222MaRDI QIDQ3724229

Lennart Brynielsson

Publication date: 1986

Published in: Advances in Cryptology — EUROCRYPT’ 85 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-39805-8_19

zbMATH Keywords

linear complexitymaximum length shift registers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Polynomials over finite fields (11T06)

Related Items (3)

Linear recurring sequences over rings and modules ⋮ Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution ⋮ Improving algebraic attacks on stream ciphers based on linear feedback shift register over \(\mathbb{F}_{2^k}\)

This page was built for publication: On the Linear Complexity of Combined Shift Register Sequences