Constructing 1-resilient rotation symmetric functions over F_p with q variables through special orthogonal arrays
DOI10.3934/AMC.2020018zbMATH Open1440.05049OpenAlexW2971638006MaRDI QIDQ2176291FDOQ2176291
Authors: Jiao Du, Longjiang Qu, Chao Li, Xin Liao 
Publication date: 4 May 2020
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020018
Recommendations
- 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
cryptographyorthogonal arrayLatin squarerotation symmetriccorrelation immuneresilient functionsupport table
Cryptography (94A60) Symmetric functions and generalizations (05E05) Orthogonal arrays, Latin squares, Room squares (05B15) Boolean functions (06E30)
Cites Work
- Construction of a class of quantum Boolean functions based on the Hadamard matrix
- Symmetric Boolean Functions
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- A secondary construction and a transformation on rotation symmetric functions, and their action on bent and semi-bent functions
- Rotation symmetric Boolean functions-count and cryptographic properties
- Constructions of Resilient S-Boxes With Strictly Almost Optimal Nonlinearity Through Disjoint Linear Codes
- Construction of rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity
- Balanced Symmetric Functions Over ${\hbox{GF}}(p)$
- Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity
- Constructions of Quadratic and Cubic Rotation Symmetric Bent Functions
- Results on rotation-symmetric S-boxes
- Rotation symmetry in algebraically generated cryptographic substitution tables
- Results on rotation symmetric polynomials over \(GF(p)\)
- Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class
- Fast Software Encryption
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- Linear structures of symmetric functions over finite fields
- Balancedness and correlation immunity of symmetric Boolean functions
- Results on constructions of rotation symmetric bent and semi-bent functions
- Title not available (Why is that?)
- On some cosets of the first-order Reed-Muller code with high minimum weight
- Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240
- A constructive count of rotation symmetric functions
- Resilient functions over finite fields
- Correlation-immune functions over finite fields
- On the number of rotation symmetric functions over \(\mathrm{GF}(p)\)
- Three characterizations of non-binary correlation-immune and resilient functions
- On the immunity of rotation symmetric Boolean functions against fast algebraic attacks
- Improved lower bound on the number of balanced symmetric functions over \(\text{GF}(p)\)
- Enumeration of balanced symmetric functions over \(GF(p)\)
- Ideal ramp schemes and augmented orthogonal arrays
- Construction of symmetric and asymmetric orthogonal arrays of strength \(t\) from orthogonal partition
Cited In (2)
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)
