Boolean functions in coding theory and cryptology. With a foreword by V. A. Sadovnichij
From MaRDI portal
(Redirected from Publication:3418762)
Recommendations
Cited in
(33)- Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method
- The graph of minimal distances of bent functions and its properties
- Mean and variance of the number of subfunctions of random Boolean function which are close to the affine functions set
- Occurrence numbers for vectors in cycles of output sequences of binary combining generators
- Editorial: Special issue on Boolean functions and their applications 2021. This special issue is dedicated to the 50th birthday of Vincent Rijmen
- A method of evaluating the security of Snow 2.0-like ciphers against correlation attacks over the finite extensions of two element field
- Analysis of coding systems
- scientific article; zbMATH DE number 5862915 (Why is no real title available?)
- Vectorial Boolean functions for cryptography
- Boolean functions in coding theory and cryptography. Translated from the Russian by Svetla Nikova
- On differential properties of a symmetric cryptoalgorithm based on pseudo-dynamic substitutions
- The sum of modules of Walsh coefficients of Boolean functions
- Boolean functions and their applications in cryptography
- Cryptographic Boolean functions and applications.
- The Hamming distance spectrum between self-dual Maiorana-McFarland bent functions
- scientific article; zbMATH DE number 2154152 (Why is no real title available?)
- On degree of nonlinearity of the coordinate polynomials for a product of transformations of a binary vector space
- scientific article; zbMATH DE number 7300318 (Why is no real title available?)
- FUNCTIONAL DECOMPOSABILITY CRITERIA FOR QUADRATIC THRESHOLD BOOLEAN FUNCTIONS
- MATRIX FORMULA FOR THE SPECTRUM OF OUTPUT DISTRIBUTION OF BLOCK CIPHER SCHEME AND STATISTICAL CRITERION BASED ON THIS FORMULA
- Properties of components for some classes of vectorial Boolean functions
- Algorithms for computing cryptographic characteristics of vectorial Boolean functions
- A method for generation of high-nonlinear S-boxes based on gradient descent
- On a property of quadratic Boolean functions
- Boolean functions for cryptography and coding theory
- Bent functions. Fundamentals and results
- Lower bound for the number of bent functions at the minimum distance from Majorana-McFarland bent functions
- Bases over the field \(\text{GF(2)}\) generated by the Schur-Hadamard operation
- Properties of vectorial Boolean functions with equivalent component functions
- Boolean functions constructed using digital sequences of linear recurrences
- On the strong affinity level of Boolean functions
- Cryptographic properties of one class of substitutions on \(\mathbb{F}_2^n\)
- Algebraically degenerate approximations of Boolean functions
This page was built for publication: Boolean functions in coding theory and cryptology. With a foreword by V. A. Sadovnichij
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418762)
