A note on the optimal immunity of Boolean functions against fast algebraic attacks
From MaRDI portal
Publication:5114985
DOI10.1007/978-981-10-4642-1_6zbMATH Open1457.94179OpenAlexW2606625375MaRDI QIDQ5114985FDOQ5114985
Publication date: 29 June 2020
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-10-4642-1_6
Recommendations
- On computing the immunity of Boolean power functions against fast algebraic attacks
- Symmetric Boolean functions depending on an odd number of variables with maximum algebraic immunity
- On the resistance of Boolean functions against fast algebraic attacks
- On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks
- On the immunity of rotation symmetric Boolean functions against fast algebraic attacks
Cites Work
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Fast Software Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation
- Perfect Algebraic Immune Functions
- Information Security and Cryptology - ICISC 2005
- On the Resistance of Boolean Functions against Fast Algebraic Attacks
- On the immunity of rotation symmetric Boolean functions against fast algebraic attacks
- Comments on ``A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
- On the Lower Block Triangular Nature of the Incidence Matrices to Compute the Algebraic Immunity of Boolean Functions
Cited In (5)
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- Progress in Cryptology - INDOCRYPT 2004
- Comments on ``A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
- On the fast algebraic immunity of majority functions
- Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks
This page was built for publication: A note on the optimal immunity of Boolean functions against fast algebraic attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114985)
