Fast low order approximation of cryptographic functions
From MaRDI portal
Publication:2876907
Recommendations
Cited in
(16)- A lower bound on the third-order nonlinearity of the simplest \(\mathcal{PS}_{a p}\) bent functions
- Statistical approximation theory for discrete functions with application in cryptanalysis of iterative block ciphers
- Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
- On third-order nonlinearity of biquadratic monomial Boolean functions
- FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR
- Low order approximation of cipher functions
- Fast Computation of Large Distributions and Its Cryptographic Applications
- Vectorial approach to fast correlation attacks
- On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\)
- Higher-order nonlinearity of Kasami functions
- On the second-order nonlinearity of the hidden weighted bit function
- Third-order nonlinearities of a subclass of Kasami functions
- On the lower bounds of the second order nonlinearities of some Boolean functions
- On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
- Literature survey on nonlinear components and chaotic nonlinear components of block ciphers
- Improved lower bounds on higher order nonlinearity
This page was built for publication: Fast low order approximation of cryptographic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876907)