Results on rotation-symmetric S-boxes

DOI10.1016/j.ins.2012.02.030zbMath1276.94017MaRDI QIDQ712704

Selçuk Kavut

Publication date: 17 October 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2012.02.030

zbMATH Keywords

finite field; permutation polynomial; affine equivalence; S-box

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

Related Items

The weight recursions for the 2-rotation symmetric quartic Boolean functions, Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach, Cellular automata based S-boxes, Equivalence of 2-rotation symmetric quartic Boolean functions, Weightwise perfectly balanced functions with high weightwise nonlinearity profile, Weights for short quartic Boolean functions, Several classes of even-variable 1-resilient rotation symmetric Boolean functions with high algebraic degree and nonlinearity, Constructing 1-resilient rotation symmetric functions over \(\mathbb{F}_p\) with \(q\) variables through special orthogonal arrays, Results on symmetric S-boxes constructed by concatenation of RSSBs, A note on rotation symmetric S-boxes, Recursion orders for weights of Boolean cubic rotation symmetric functions, Theory of 2-rotation symmetric cubic Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\)
• Differential cryptanalysis of DES-like cryptosystems
• Rotation symmetric Boolean functions-count and cryptographic properties
• 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class
• Rotation symmetry in algebraically generated cryptographic substitution tables
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• On some cosets of the first-order Reed-Muller code with high minimum weight
• Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
• Higher Order Derivatives and Differential Cryptanalysis
• On Almost Perfect Nonlinear Permutations
• On the Classification of 4 Bit S-Boxes
• Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240
• Fast Software Encryption
• Fast Software Encryption