A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
From MaRDI portal
Publication:2197451
Recommendations
- Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
- Constructions of balanced Boolean functions with high nonlinearity and high algebraic degree
- Further properties of several classes of Boolean functions with optimum algebraic immunity
Cites work
- scientific article; zbMATH DE number 5862915 (Why is no real title available?)
- scientific article; zbMATH DE number 6001198 (Why is no real title available?)
- scientific article; zbMATH DE number 1972847 (Why is no real title available?)
- scientific article; zbMATH DE number 2009966 (Why is no real title available?)
- A Maiorana--McFarland type construction for resilient Boolean functions on \(n\) variables (\(n\) even) with nonlinearity \(>2^{n-1}-2^{n/2}+2^{n/2-2}\)
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- A construction of 1-resilient Boolean functions with good cryptographic properties
- A note on the fast algebraic immunity and its consequences on modified majority functions
- A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
- Boolean functions optimizing most of the cryptographic criteria
- Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks
- Construction of Highly Nonlinear 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Provably High Fast Algebraic Immunity
- Construction of \(n\)-variable \((n\equiv 2\bmod 4)\) balanced Boolean functions with maximum absolute value in autocorrelation spectra \(<2^{\frac{n}{2}}\)
- Construction of nonlinear Boolean functions with important cryptographic properties
- Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
- Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Finding nonnormal bent functions
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- Generalized Maiorana–McFarland Construction of Resilient Boolean Functions With High Nonlinearity and Good Algebraic Properties
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
- Normal Extensions of Bent Functions
- On a generalised combinatorial conjecture involving addition mod \(2^k-1\)
- Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields
- Two Classes of Symmetric Boolean Functions With Optimum Algebraic Immunity: Construction and Analysis
- Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks
Cited in
(4)- On hardware implementation of Tang-maitra Boolean functions
- Construction of Highly Nonlinear 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Provably High Fast Algebraic Immunity
- Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks
- A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
This page was built for publication: A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197451)
