On the lower bounds of the second order nonlinearities of some Boolean functions
From MaRDI portal
Publication:845338
DOI10.1016/j.ins.2009.09.006zbMath1184.94236OpenAlexW2010368681MaRDI QIDQ845338
Sumanta Sarkar, Ruchi Telang, Sugata Gangopadhyay
Publication date: 28 January 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2009.09.006
Related Items (17)
On lower bounds of second-order nonlinearities of cubic bent functions constructed by concatenating Gold functions ⋮ LOWER BOUNDS ON THE SECOND ORDER NONLINEARITY OF BOOLEAN FUNCTIONS ⋮ On the second-order nonlinearity of the hidden weighted bit function ⋮ A new lower bound on the second-order nonlinearity of a class of monomial bent functions ⋮ On higher order nonlinearities of Boolean functions ⋮ The lower bounds on the second-order nonlinearity of three classes of Boolean functions ⋮ A lower bound on the third-order nonlinearity of the simplest \(\mathcal{PS}_{a p}\) bent functions ⋮ Monomial Boolean functions with large high-order nonlinearities ⋮ The lower bound on the second-order nonlinearity of a class of Boolean functions with high nonlinearity ⋮ On the number of the rational zeros of linearized polynomials and the second-order nonlinearity of cubic Boolean functions ⋮ Affine inequivalence of cubic Maiorana-McFarland type bent functions ⋮ Higher-order nonlinearity of Kasami functions ⋮ Gowers \(U_3\) norm of some classes of bent Boolean functions ⋮ 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 ⋮ Improving lower bounds on the second-order nonlinearity of three classes of Boolean functions ⋮ On the higher-order nonlinearity of a Boolean bent function class (constructed via Niho power functions)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List decoding of the first-order binary Reed-Muller codes
- The lower bounds on the second order nonlinearity of three classes of Boolean functions with high nonlinearity
- An improved list decoding algorithm for the second order Reed-Muller codes and its applications
- On ``bent functions
- Cubic bent functions
- A new class of monomial bent functions
- Non-Linear Approximations in Linear Cryptanalysis
- Fast Low Order Approximation of Cryptographic Functions
- Decomposing bent functions
- Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
- Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications
- The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)
- The covering radius of the<tex>(2^{15}, 16)</tex>Reed-Muller code is at least 16276
- Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions − 9 Variable Boolean Functions with Nonlinearity 242
- Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240
- Weight distributions of the cosets of the (32,6) Reed-Muller code
This page was built for publication: On the lower bounds of the second order nonlinearities of some Boolean functions
