Rotation symmetry in algebraically generated cryptographic substitution tables
From MaRDI portal
(Redirected from Publication:963378)
Recommendations
- A note on rotation symmetric S-boxes
- Results on rotation-symmetric S-boxes
- Generation of 8-bit S-boxes having almost optimal cryptographic properties using smaller 4-bit S-boxes and finite field multiplication
- On Cryptographically Significant Mappings over GF(2 n )
- The change in linear and differential characteristics of substitution after the multiplication by transposition
Cites work
Cited in
(14)- Constructing 1-resilient rotation symmetric functions over \(\mathbb{F}_p\) with \(q\) variables through special orthogonal arrays
- A generic construction of rotation symmetric bent functions
- A note on rotation symmetric S-boxes
- Cellular automata based S-boxes
- Algebraic properties of the maps \(\chi_n\)
- Results on constructions of rotation symmetric bent and semi-bent functions
- A cryptographic and coding-theoretic perspective on the global rules of cellular automata
- Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions
- Insights gained after a decade of cellular automata-based cryptography
- Results on rotation-symmetric S-boxes
- Spin me right round rotational symmetry for FPGA-specific AES: extended version
- Results on symmetric S-boxes constructed by concatenation of RSSBs
- Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach
- On the APN-ness and differential uniformity of some classes of \((n,n)\)-functions over \(\mathbb{F}_2^n\)
This page was built for publication: Rotation symmetry in algebraically generated cryptographic substitution tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963378)
