Constructing 1-resilient rotation symmetric functions over F_p with q variables through special orthogonal arrays
In this paper, two classes of \(q\)-variable 1-resilient rotation symmetric functions (RSFs) over \(\mathbb{F}_p\) are constructed. This construction is based on the relation between resilient functions and large sets of orthogonal arrays. A generalized method of the known results proposed by \textit{J. Du} et al. [``New constructions of \(q\)-variable 1-resilient rotation symmetric functions over \({\mathbb F}_p\), Sci. China, Inf. Sci. 59, No. 7, Article ID 079102 (2016)] to obtain a class of \(q\)-variable 1-resilient RSFs was proved. The first class of 1-resilient functions is obtained with the help of a Latin square with maximum cycle structure, and the second class of 1-resilient functions is constructed via switching the rotation symmetric orbits of the former class. For this, an efficient method to construct \(\mathrm{OA}(pq; q; p; 1)\) is presented via solving a linear equation system. Secondly, some schemes to construct more \(q\)-variable 1-resilient RSFs by modifying the \(l\)-value support tables of the known \(q\)-variable 1-resilient RSFs were proposed. In addition, two examples are given to demonstrate their constructions. The construction of 1-resilient RSFs on given number of variables remains an open problem.
- Construction and count of 1-resilient rotation symmetric Boolean functions
- Several classes of even-variable 1-resilient rotation symmetric Boolean functions with high algebraic degree and nonlinearity
- Constructions of 2-resilient rotation symmetric Boolean functions through symbol transformations of cyclic Hadamard matrix
- Resilient functions over finite fields
- On construction of a class of nonlinear resilient functions
- A constructive count of rotation symmetric functions
- A secondary construction and a transformation on rotation symmetric functions, and their action on bent and semi-bent functions
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- Balanced Symmetric Functions Over ${\hbox{GF}}(p)$
- Balancedness and correlation immunity of symmetric Boolean functions
- Construction of a class of quantum Boolean functions based on the Hadamard matrix
- Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity
- Construction of rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity
- Construction of symmetric and asymmetric orthogonal arrays of strength \(t\) from orthogonal partition
- Constructions of Quadratic and Cubic Rotation Symmetric Bent Functions
- Constructions of Resilient S-Boxes With Strictly Almost Optimal Nonlinearity Through Disjoint Linear Codes
- Correlation-immune functions over finite fields
- Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240
- Enumeration of balanced symmetric functions over GF(p)
- Fast Software Encryption
- scientific article; zbMATH DE number 1303143 (Why is no real title available?)
- Ideal ramp schemes and augmented orthogonal arrays
- Improved lower bound on the number of balanced symmetric functions over \(\text{GF}(p)\)
- Linear structures of symmetric functions over finite fields
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- On some cosets of the first-order Reed-Muller code with high minimum weight
- On the immunity of rotation symmetric Boolean functions against fast algebraic attacks
- On the number of rotation symmetric functions over \(\mathrm{GF}(p)\)
- Resilient functions over finite fields
- Results on constructions of rotation symmetric bent and semi-bent functions
- Results on rotation symmetric polynomials over \(GF(p)\)
- Results on rotation-symmetric S-boxes
- Rotation symmetric Boolean functions-count and cryptographic properties
- Rotation symmetry in algebraically generated cryptographic substitution tables
- Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class
- Symmetric Boolean Functions
- Three characterizations of non-binary correlation-immune and resilient functions
- Constructions of 2-resilient rotation symmetric Boolean functions through symbol transformations of cyclic Hadamard matrix
- Construction and count of 1-resilient rotation symmetric Boolean functions
- Construction of high strength orthogonal arrays with repeated rows
- Constructions of optimal 2-level orthogonal arrays with repeated rows
- Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization
This page was built for publication: Constructing 1-resilient rotation symmetric functions over \(\mathbb{F}_p\) with \(q\) variables through special orthogonal arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176291)
