How to improve the nonlinearity of bijective S-boxes.
From MaRDI portal
Cited in
(13)- Application based construction and optimization of substitution boxes over 2D mixed chaotic maps
- Designing cryptographically strong \(S\)-boxes with the use of cellular automata
- The designs of S-boxes by simulated annealing
- Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
- Spectral-linear and spectral-differential methods for generating S-boxes having almost optimal cryptographic parameters
- The change in linear and differential characteristics of substitution after the multiplication by transposition
- Cryptographically Strong S-Boxes Based on Cellular Automata
- Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
- A New Design of Substitution Box with Ideal Strict Avalanche Criterion
- Parallel steepest ascent hill-climbing for high nonlinear Boolean and vectorial Boolean functions (S-boxes)
- On the transformation of a Boolean function that improves its nonlinearity
- Investigation of some cryptographic properties of the \(8 \times 8\) S-boxes created by quasigroups
- A construction of bent functions of \(n+2\) variables from a bent function of \(n\) variables and its cyclic shifts
This page was built for publication: How to improve the nonlinearity of bijective S-boxes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3839176)
