Fast low order approximation of cryptographic functions
From MaRDI portal
Publication:2876907
DOI10.1007/3-540-68339-9_24zbMATH Open1304.94063OpenAlexW1814665593MaRDI QIDQ2876907FDOQ2876907
Authors: J. Dj. Golić 
Publication date: 20 August 2014
Published in: Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-68339-9_24
Recommendations
Cited In (16)
- Statistical approximation theory for discrete functions with application in cryptanalysis of iterative block ciphers
- FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR
- Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
- On third-order nonlinearity of biquadratic monomial Boolean functions
- 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
- A lower bound on the third-order nonlinearity of the simplest \(\mathcal{PS}_{a p}\) bent functions
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)
