Cryptography and Coding

DOI10.1007/11586821MaRDI QIDQ5897528zbMATH OpenOpenAlexFDO

Authors An Braeken, Bart Preneel

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11586821

zbMATH Keywords

algebraic attackalgebraic immunityannihilatorcombination and filter generatorWalsh spectrum

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Recommendations

• Algebraic side-channel attacks
• Algebraic attacks using binary decision diagrams
• Fast Software Encryption
• Guess-and-determine attack and algebraic attack
• Fast Software Encryption
• Algebraic attacks from a Groebner basis perspective
• Algebraic attacks using SAT-solvers
• Algebraic Attacks Using IP-Solvers

Cited in

(6)

• Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
• Results on the immunity of Boolean functions against probabilistic algebraic attacks
• On the efficiency of the probabilistic neutral bits method in statistical cryptanalysis of synchronous stream ciphers
• Algebraic cryptanalysis of stream ciphers using decomposition of Boolean function
• Algebraic Attacks Using IP-Solvers
• Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited

This page was built for publication: Cryptography and Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897528)