Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large \(n\)
From MaRDI portal
Publication:2293177
DOI10.1016/j.ins.2017.03.025zbMath1454.94105OpenAlexW2601128649MaRDI QIDQ2293177
Fengrong Zhang, Samir Hodžić, Enes Pašalić, Yongzhuang Wei
Publication date: 7 February 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.03.025
Related Items
Cites Work
- Unnamed Item
- Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functions
- Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
- A recursive construction of highly nonlinear resilient vectorial functions
- Generalized Maiorana–McFarland Construction of Resilient Boolean Functions With High Nonlinearity and Good Algebraic Properties
- Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks
- Algebraic Immunity of S-Boxes and Augmented Functions
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Computing the Algebraic Immunity Efficiently
- Upper Bounds on Algebraic Immunity of Boolean Power Functions
- Perfect Algebraic Immune Functions
- Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions
- Advances in Cryptology - CRYPTO 2003
- Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks
- Evaluating the Resistance of Stream Ciphers with Linear Feedback Against Fast Algebraic Attacks
