A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation

DOI10.1007/s12095-011-0057-zzbMath1235.94050OpenAlexW1999462314MaRDI QIDQ662198

Enes Pašalić

Publication date: 21 February 2012

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-011-0057-z

zbMATH Keywords

annihilatorsBoolean functionalgebraic immunityalgebraic attack resistantfast algebraic attackshigh degree product

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items (5)

Comments on ``A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation ⋮ Secondary constructions of Boolean functions with maximum algebraic immunity ⋮ On the algebraic immunity of multiplexer Boolean functions ⋮ Characterization of robust immune symmetric Boolean functions ⋮ A construction of Boolean functions with good cryptographic properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Basic theory in construction of Boolean functions with maximum possible annihilator immunity
• Fast correlation attacks on certain stream ciphers
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
• A New Attack on the Filter Generator
• An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
• Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Algebraic Attacks on Combiners with Memory and Several Outputs
• On the Algebraic Immunity of Symmetric Boolean Functions
• Revisiting Correlation-Immunity in Filter Generators
• Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
• Fast Software Encryption
• Fast Software Encryption
• Coding and Cryptography

This page was built for publication: A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation