Sequences, DFT and Resistance against Fast Algebraic Attacks

DOI10.1007/978-3-540-85912-3_19zbMath1206.94031OpenAlexW1552416906MaRDI QIDQ3600442

Guang Gong

Publication date: 10 February 2009

Published in: Sequences and Their Applications - SETA 2008 (Search for Journal in Brave)

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

zbMATH Keywords

stream cipherspolynomialsdiscrete Fourier transformbasesfast algebraic attackLFSR\(m\)-sequencestrace representations

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis and design of stream ciphers
• A New Attack on the Filter Generator
• Upper Bounds on Algebraic Immunity of Boolean Power Functions
• On cryptographic properties of the cosets of R(1, m)
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• A Survey of Recent Attacks on the Filter Generator
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• On Attacks on Filtering Generators Using Linear Subspace Structures
• Fast Software Encryption
• Progress in Cryptology – Mycrypt 2005
• Fast Software Encryption
• On the Higher Order Nonlinearities of Algebraic Immune Functions

This page was built for publication: Sequences, DFT and Resistance against Fast Algebraic Attacks