A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
From MaRDI portal
Publication:1999897
DOI10.1007/s10623-018-0574-2zbMath1453.94123OpenAlexW2898494885WikidataQ129025433 ScholiaQ129025433MaRDI QIDQ1999897
Pantelimon Stănică, Qichun Wang
Publication date: 27 June 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-018-0574-2
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Trigonometric and exponential sums (general theory) (11L03)
Related Items (2)
A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost ⋮ The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences
- 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
- Four decades of research on bent functions
- 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class
- Maximal values of generalized algebraic immunity
- Fast correlation attacks on certain stream ciphers
- On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\)
- New bounds on the covering radius of the second order Reed-Muller code of length 128
- Gowers \(U_3\) norm of some classes of bent Boolean functions
- Covering radius of the Reed-Muller code \(R(1,7)\) -- a simpler proof
- The covering radius of \(R(1,9)\) in \(R(4,9)\)
- Properties of a Family of Cryptographic Boolean Functions
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
- Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class
- On the Nonlinearity of Discrete Logarithm in $\mathbb F_{2^n}$
- 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
- The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)
- On the norm and covering radius of the first-order Reed-Muller codes
- Construction of $n$ -Variable ( $n\equiv 2 \bmod 4$ ) Balanced Boolean Functions With Maximum Absolute Value in Autocorrelation Spectra $
- The covering radius of the<tex>(2^{15}, 16)</tex>Reed-Muller code is at least 16276
- On the covering radius of R(1, m) in R(3, m)
- 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
- 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
- Weight distributions of the cosets of the (32,6) Reed-Muller code
This page was built for publication: A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
