Attacking the Filter Generator over GF(2 m )

DOI10.1007/978-3-540-73074-3_20zbMath1248.94091OpenAlexW1561523951MaRDI QIDQ5426095

Tor Helleseth, Sondre Rønjom

Publication date: 15 November 2007

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

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

zbMATH Keywords

Boolean functions\(m\)-sequencessolving nonlinear equationsFilter generators

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) Cryptography (94A60)

Related Items (4)

A Survey of Recent Attacks on the Filter Generator ⋮ Improving algebraic attacks on stream ciphers based on linear feedback shift register over \(\mathbb{F}_{2^k}\) ⋮ WG: a family of stream ciphers with designed randomness properties ⋮ Remarks on the New Attack on the Filter Generator and the Role of High Order Complexity

This page was built for publication: Attacking the Filter Generator over GF(2 m )