Boolean functions in coding theory and cryptography. Translated from the Russian by Svetla Nikova
From MaRDI portal
Publication:3223908
zbMATH Open1253.94002MaRDI QIDQ3223908FDOQ3223908
Authors: O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko 
Publication date: 9 March 2012
Recommendations
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Boolean functions (06E30)
Cited In (28)
- Estimates of the capacity of orthogonal arrays of large strength
- Application of composition primitive polynomials for implementation of large-scale S-boxes
- Boolean functions as points on the hypersphere in the Euclidean space
- Some general properties of modified bent functions through addition of indicator functions
- 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
- Analysis of coding systems
- Vectorial Boolean functions for cryptography
- A graph of minimal distances between bent functions
- Cryptographic Boolean functions and applications.
- A novel stream encryption scheme with avalanche effect
- Bent functions. Fundamentals and results
- On complexity of searching for periods of functions given by polynomials over a prime field
- An improved test of Boolean functions for \(k\)-dimensionality
- Synthesis of highly nonlinear S-boxes satisfying higher order propagation criterion
- Improved upper bound for the relative distance between a Boolean function and the set of \(k\)-dimensional functions
- Boolean functions and their applications in cryptography
- Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\)
- Editorial: Special issue on Boolean functions and their applications
- Multiaffinity testing of Boolean functions using their Zhegalkin polynomials
- On a lower bound for the number of bent functions at the minimum distance from a bent function in the Maiorana-McFarland class
- On permutations that break subspaces of specified dimensions
- On the \(\Delta \)-equivalence of Boolean functions
- Nonlinearity of \(k\)-cycle permutations on \(\mathbb Z_n\)
- On the image of an affine subspace under the inverse function within a finite field
- Boolean functions in coding theory and cryptology. With a foreword by V. A. Sadovnichij
- On nonlinearity of Boolean functions generated by the generalized Dobbertin construction
- Boolean functions for cryptography and coding theory
This page was built for publication: Boolean functions in coding theory and cryptography. Translated from the Russian by Svetla Nikova
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3223908)
