Fast Low Order Approximation of Cryptographic Functions
From MaRDI portal
Publication:2876907
DOI10.1007/3-540-68339-9_24zbMath1304.94063OpenAlexW1814665593MaRDI QIDQ2876907
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
Related Items
Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties ⋮ On third-order nonlinearity of biquadratic monomial Boolean functions ⋮ On the lower bounds of the second order nonlinearities of some Boolean functions ⋮ Third-order nonlinearities of a subclass of Kasami functions ⋮ On the second-order nonlinearity of the hidden weighted bit function ⋮ A lower bound on the third-order nonlinearity of the simplest \(\mathcal{PS}_{a p}\) bent functions ⋮ Unnamed Item ⋮ Literature survey on nonlinear components and chaotic nonlinear components of block ciphers ⋮ Higher-order nonlinearity of Kasami functions ⋮ On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations ⋮ On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\) ⋮ Vectorial approach to fast correlation attacks
