Properties of a Family of Cryptographic Boolean Functions
From MaRDI portal
Publication:2945065
DOI10.1007/978-3-319-12325-7_3zbMath1337.94077OpenAlexW2169388465MaRDI QIDQ2945065
Publication date: 9 September 2015
Published in: Sequences and Their Applications - SETA 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12325-7_3
Cryptography (94A60) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)
Related Items (7)
Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction ⋮ A characterization of balanced Boolean functions with optimal algebraic immunity ⋮ On nonlinearity of Boolean functions generated by the generalized Dobbertin construction ⋮ Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields ⋮ A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions ⋮ Perfect nonlinear functions and cryptography ⋮ Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Maximal values of generalized algebraic immunity
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
- A new method to construct Boolean functions with good cryptographic properties
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- On a Combinatorial Conjecture
- A Note on Fast Algebraic Attacks and Higher Order Nonlinearities
- Counting irreducible polynomials over finite fields
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- On a Conjecture about Binary Strings Distribution
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
- Perfect Algebraic Immune Functions
- Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- Comments on "Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation
- Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- On the Algebraic Immunity of Symmetric Boolean Functions
- Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
- Fast Software Encryption
This page was built for publication: Properties of a Family of Cryptographic Boolean Functions
