A new construction of highly nonlinear S-boxes
From MaRDI portal
Publication:662201
DOI10.1007/S12095-011-0052-4zbMATH Open1277.94013OpenAlexW2076872242MaRDI QIDQ662201FDOQ662201
Authors: Gregor Leander, Peter Beelen 
Publication date: 21 February 2012
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-011-0052-4
Recommendations
Cryptography (94A60) Linear codes (general theory) (94B05) Bounds on codes (94B65) Boolean functions (06E30) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- The Magma algebra system. I: The user language
- Perfect nonlinear S-boxes
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Nonlinearities of S-boxes
- New families of quadratic almost perfect nonlinear trinomials and multinomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function
Cited In (10)
- Parameterization of Boolean functions by vectorial functions and associated constructions
- Construction of highly nonlinear resilient S-boxes with given degree
- On differential properties of a symmetric cryptoalgorithm based on pseudo-dynamic substitutions
- Perfect nonlinear S-boxes on the real-line
- On the algebraic immunity of multiplexer Boolean functions
- Improved Construction of Nonlinear Resilient S-Boxes
- Constructing S-boxes with low multiplicative complexity
- A novel algebraic construction of strong S-boxes over double \(GF(2^7)\) structures and image protection
- On the nonlinearity of S-boxes and linear codes
- Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators
Uses Software
This page was built for publication: A new construction of highly nonlinear S-boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662201)
