Characterization of robust immune symmetric Boolean functions
From MaRDI portal
Publication:892387
DOI10.1007/s12095-014-0120-7zbMath1343.94106OpenAlexW1983450185MaRDI QIDQ892387
Publication date: 19 November 2015
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-014-0120-7
Cites Work
- Unnamed Item
- Unnamed Item
- A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
- Lower bounds for polynomial calculus in the case of nonbinomial ideals.
- A complex-number Fourier technique for lower bounds on the mod-\(m\) degree
- On the \(2^{m}\)-variable symmetric Boolean functions with maximum algebraic immunity
- Certifying polynomials for AC^0(parity) circuits, with applications
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- On $2k$-Variable Symmetric Boolean Functions With Maximum Algebraic Immunity $k$
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- Symmetric Boolean functions depending on an odd number of variables with maximum algebraic immunity
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- On Symmetric Boolean Functions With High Algebraic Immunity on Even Number of Variables
- Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions
- On the Algebraic Immunity of Symmetric Boolean Functions
