scientific article
From MaRDI portal
Publication:3223908
zbMath1253.94002MaRDI QIDQ3223908
Oleg A. Logachev, A. A. Sal'nikov, Valerii V. Yashchenko
Publication date: 9 March 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cryptography (94A60) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Boolean functions (06E30)
Related Items (18)
Some general properties of modified bent functions through addition of indicator functions ⋮ Synthesis of highly nonlinear S-boxes satisfying higher order propagation criterion ⋮ Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\) ⋮ Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials ⋮ On the number of ones in the cycle of multicyclin sequence determined by Boolean function ⋮ Multiaffinity testing of Boolean functions using their Zhegalkin polynomials ⋮ On nonlinearity of Boolean functions generated by the generalized Dobbertin construction ⋮ On the image of an affine subspace under the inverse function within a finite field ⋮ A novel stream encryption scheme with avalanche effect ⋮ Improved upper bound for the relative distance between a Boolean function and the set of \(k\)-dimensional functions ⋮ Nonlinearity of k-cycle permutations on ℤn ⋮ Application of composition primitive polynomials for implementation of large-scale S-boxes ⋮ An improved test of Boolean functions for \(k\)-dimensionality ⋮ Estimates of the capacity of orthogonal arrays of large strength ⋮ Граф минимальных расстояний между булевыми функциями ⋮ Boolean functions as points on the hypersphere in the Euclidean space ⋮ On the \(\Delta \)-equivalence of Boolean functions ⋮ On complexity of searching for periods of functions given by polynomials over a prime field
This page was built for publication:
