Construction of nonlinear Boolean functions with important cryptographic properties
From MaRDI portal
Publication:3374931
zbMATH Open1082.94529MaRDI QIDQ3374931FDOQ3374931
Authors: Palash Sarkar, Subhamoy Maitra 
Publication date: 1 March 2006
Recommendations
- scientific article; zbMATH DE number 1024044
- Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
- Nonlinearity and propagation characteristics of balanced Boolean functions
- Construction of balanced Boolean functions with high nonlinearity, good local and global avalanche characteristics
- scientific article; zbMATH DE number 1955795
Cited In (46)
- On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions
- Quark: a lightweight hash
- Improving high-meets-low technique to generate odd-variable resilient Boolean functions with currently best nonlinearity
- A new method to construct Boolean functions with good cryptographic properties
- Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros
- 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}\)
- Construction of resilient Boolean functions in odd variables with strictly almost optimal nonlinearity
- Title not available (Why is that?)
- New constructions of balanced Boolean functions with high nonlinearity and optimal algebraic degree
- Connections among nonlinearity, avalanche and correlation immunity
- Title not available (Why is that?)
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions
- Improved cryptographic properties of Boolean functions obtained from the neighbourhood of Patterson-Wiedemann functions
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Rotation symmetric Boolean functions-count and cryptographic properties
- Highly nonlinear balanced Boolean functions with very good autocorrelation property
- Hybrid classes of balanced Boolean functions with good cryptographic properties
- On the constructions and nonlinearity of binary vector-output correlation-immune functions
- Cryptographical Boolean functions construction from linear codes
- A super-set of Patterson-Wiedemann functions -- upper bounds and possible nonlinearities
- Concatenating indicators of flats for designing cryptographic functions
- Highly nonlinear balanced Boolean functions with good local and global avalanche characteristics.
- Construction of balanced Boolean functions with high nonlinearity and good autocorrelation properties
- A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography
- A construction of bent functions of \(n+2\) variables from a bent function of \(n\) variables and its cyclic shifts
- Title not available (Why is that?)
- Synthesis of highly nonlinear S-boxes satisfying higher order propagation criterion
- Third-order nonlinearities of a subclass of Kasami functions
- On the construction of new bent functions from the max-weight and min-weight functions of old bent functions
- Dirichlet product for Boolean functions
- New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity
- Modifications of Patterson-Wiedemann functions for cryptographic applications
- Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm
- New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions
- S-blocks of a special type with a small number of variables
- Title not available (Why is that?)
- On Boolean functions derived from linear maps over \(\mathbb{Z}_4\) and their application to secret sharing
- Progress in Cryptology - INDOCRYPT 2003
- Highly nonlinear resilient functions through disjoint codes in projective spaces.
- Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
- Constructions of Resilient S-Boxes With Strictly Almost Optimal Nonlinearity Through Disjoint Linear Codes
- Title not available (Why is that?)
- Highly nonlinear balanced S-boxes with improved bound on unrestricted and generalized nonlinearity
- A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
- A quantum algorithm for testing and learning resiliency of a Boolean function
- Design methods for semi-bent functions
This page was built for publication: Construction of nonlinear Boolean functions with important cryptographic properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374931)
