Differentially uniform mappings for cryptography
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
On almost perfect nonlinear permutations
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems
Designs, Codes and Cryptography
Rotation symmetry in algebraically generated cryptographic substitution tables
Information Processing Letters
Rotation symmetric Boolean functions-Count and cryptographic properties
Discrete Applied Mathematics
On the Classification of 4 Bit S-Boxes
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Affinity of permutations of F2n
Discrete Applied Mathematics - Special issue: Coding and cryptography
9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class
Information and Computation
A toolbox for cryptanalysis: linear and affine equivalence algorithms
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Permutation polynomials EA-equivalent to the inverse function over GF (2n)
Cryptography and Communications
Enumeration of 9-variable rotation symmetric boolean functions having nonlinearity 240
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
On some cosets of the first-order Reed-Muller code with high minimum weight
IEEE Transactions on Information Theory
Almost perfect nonlinear power functions on GF(2n): the Welch case
IEEE Transactions on Information Theory
| Hi-index | 0.07 |
We give an efficient exhaustive search strategy to enumerate 6x6 bijective rotation-symmetric S-boxes (RSSBs) having nonlinearity 24, which is found to be the maximum nonlinearity within the class of 6x6 bijective RSSBs. It is shown that there are 3072 RSSBs achieving the cryptographic properties of the inverse function over GF(2^6), i.e., nonlinearity 24, differential uniformity 4, and algebraic degree 5, such that among them there are only four which are not affine-equivalent. Among these four RSSBs, we find a non-affine transformation under which the cryptographic properties of the inverse function are invariant. Then, we define the generalized classes of k-RSSBs as the polynomials of GF(2^n) with coefficients in GF(2^k), where k divides n. Moreover, motivated by the fact that RSSBs are symmetric under a special permutation, we classify all possible permutations up to the linear equivalence of S-boxes that are symmetric under them.