In the article we study boolean functions with affine annihilators. We have obtained results in both, estimating the number of functions under study and defining the relationship between Walsh-Hadamard coefficients of an arbitrary boolean function and its affine annihilator available. The second section of this article focuses on estimating the number of boolean functions with affine annihilators. The value has top and bottom bound. Besides, we have obtained the asymptotic estimate of the number of boolean functions with affine annihilators. The third section studies the Walsh-Hadamard coefficients of boolean functions with affine annihilators. First, we have derived the dependence of the Walsh-Hadamard coefficient on the distance between a...
In this paper we want to estimate the nonlinearity of Boolean functions, by probabilistic methods, w...
Boolean functions are the mathematical basis of modern cryptographic algorithms. However, in practic...
Boolean functions are the mathematical basis of modern cryptographic algorithms. However, in practic...
So far, there are no efficient algorithms to solve a problem of finding the low degree annihilators ...
Algebraic immunity AI(f) defined for a boolean function f measures the resistance of the function ag...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
Algebraic immunity AI(f) defined for a boolean function f measures the resistance of the function ag...
The paper presents conditions of extension of the weakly defined Boolean functions to their full aff...
Abstract By Walsh transform, autocorrelation function, decomposition, derivation and modification of...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
The relation between the Walsh-Hadamard transform and the auto-correlation function of Boolean funct...
By Walsh transform, autocorrelation function, decomposition, derivation and modification of truth ta...
While performing cryptanalysis, it is of interest to approximate a Boolean function in n variables ...
In this paper we want to estimate the nonlinearity of Boolean functions, by probabilistic methods, w...
Boolean functions are the mathematical basis of modern cryptographic algorithms. However, in practic...
Boolean functions are the mathematical basis of modern cryptographic algorithms. However, in practic...
So far, there are no efficient algorithms to solve a problem of finding the low degree annihilators ...
Algebraic immunity AI(f) defined for a boolean function f measures the resistance of the function ag...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
Algebraic immunity AI(f) defined for a boolean function f measures the resistance of the function ag...
The paper presents conditions of extension of the weakly defined Boolean functions to their full aff...
Abstract By Walsh transform, autocorrelation function, decomposition, derivation and modification of...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
The relation between the Walsh-Hadamard transform and the auto-correlation function of Boolean funct...
By Walsh transform, autocorrelation function, decomposition, derivation and modification of truth ta...
While performing cryptanalysis, it is of interest to approximate a Boolean function in n variables ...
In this paper we want to estimate the nonlinearity of Boolean functions, by probabilistic methods, w...
Boolean functions are the mathematical basis of modern cryptographic algorithms. However, in practic...
Boolean functions are the mathematical basis of modern cryptographic algorithms. However, in practic...