On the difficulty of constructing cryptographically strong substitution boxes
From MaRDI portal
Recommendations
Cited in
(16)- On immunity against Biham and Shamir's differential cryptanalysis
- Resistance of balanced s-boxes to linear and differential cryptanalysis
- Relating differential distribution tables to other properties of substitution boxes
- On a generalization of substitution-permutation networks: the HADES design strategy
- Thinking outside the superbox
- The design of composite permutations with applications to DES-like S-boxes
- Relating Undisturbed Bits to Other Properties of Substitution Boxes
- The change in linear and differential characteristics of substitution after the multiplication by transposition
- Perfect nonlinear S-boxes
- Constructing large cryptographically strong S-boxes
- Relationship among nonlinearity criteria. (Extended abstract)
- scientific article; zbMATH DE number 1542860 (Why is no real title available?)
- Differential and linear distributions of substitution boxes for symmetric-key cryptosystems
- Pitfalls in designing substitution boxes
- Quadratic approximations of the special type for the 4-bit permutations in S-boxes
- Designing S-boxes providing stronger security against differential cryptanalysis for ciphers using byte-wise XOR
This page was built for publication: On the difficulty of constructing cryptographically strong substitution boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4942036)
