Third-order nonlinearities of a subclass of Kasami functions
From MaRDI portal
Publication:2380850
DOI10.1007/s12095-009-0017-zzbMath1192.94096OpenAlexW1986486920MaRDI QIDQ2380850
Sugata Gangopadhyay, Ruchi Gode
Publication date: 12 April 2010
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-009-0017-z
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
On lower bounds of second-order nonlinearities of cubic bent functions constructed by concatenating Gold functions ⋮ On third-order nonlinearity of biquadratic monomial Boolean functions ⋮ On higher order nonlinearities of Boolean functions ⋮ On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\) ⋮ 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 ⋮ Unnamed Item ⋮ Higher-order nonlinearity of Kasami 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
- 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
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Another proof of Kasami's theorem
- A new class of monomial bent functions
- Non-Linear Approximations in Linear Cryptanalysis
- Fast Low Order Approximation of Cryptographic 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
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Weight distributions of the cosets of the (32,6) Reed-Muller code
This page was built for publication: Third-order nonlinearities of a subclass of Kasami functions
