A new construction of highly nonlinear S-boxes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 503330 (Why is no real title available?)
- scientific article; zbMATH DE number 3335651 (Why is no real title available?)
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- New families of quadratic almost perfect nonlinear trinomials and multinomials
- Nonlinearities of S-boxes
- Perfect nonlinear S-boxes
- The Magma algebra system. I: The user language
- Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function
Cited in
(10)- Constructing S-boxes with low multiplicative complexity
- Improved Construction of Nonlinear Resilient S-Boxes
- Perfect nonlinear S-boxes on the real-line
- Parameterization of Boolean functions by vectorial functions and associated constructions
- Construction of highly nonlinear resilient S-boxes with given degree
- Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators
- 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
- On differential properties of a symmetric cryptoalgorithm based on pseudo-dynamic substitutions
- On the algebraic immunity of multiplexer Boolean functions
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)
