Add to ORKGThe paper presents conditions of extension of the weakly defined Boolean functions to their full affine form. The main goal of the analysis is a fast estimation whether a given incompletely defined function can be extended to a full affine form. If it is possible a simple algorithm of the states completion has been proposed. In such a case undefined points are clearly replaced by 0, 1 values. Spectral coefficients of a Boolean function allow to determine whether a partially defined function can be realised as affine
Boolean functions are the mathematical basis of modern cryptographic algorithms. However, in practic...
We consider the problem of checking the generalized affine equivalence of two given Boolean function...
AbstractIn this paper we consider four possible definitions for extending a partially defined Boolea...
In the article we study boolean functions with affine annihilators. We have obtained results in both...
In this paper, a class of linear Boolean functions is analyzed. The Boolean function can be represen...
AbstractIn this paper, we address a fundamental problem related to the induction of Boolean logic: G...
This paper discusses a problem of recognition of the Boolean function's linearity. The article descr...
Boolean functions expressing some particular properties often appear in engineering practice. Theref...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
Abstract-A theory has been developed to calculate the Ra-demacher-Walsh t ransform f rom a cube a r ...
Affine equivalence of Boolean functions has various applications in computer science and modern cryp...
So far, there are no efficient algorithms to solve a problem of finding the low degree annihilators ...
AbstractIn this paper we consider four possible definitions for extending a partially defined Boolea...
The paper discusses the problem of recognizing the Boolean function linearity. A spectral method of ...
In this article, we study two representations of a Boolean function which are very important in the ...
Boolean functions are the mathematical basis of modern cryptographic algorithms. However, in practic...
We consider the problem of checking the generalized affine equivalence of two given Boolean function...
AbstractIn this paper we consider four possible definitions for extending a partially defined Boolea...
In the article we study boolean functions with affine annihilators. We have obtained results in both...
In this paper, a class of linear Boolean functions is analyzed. The Boolean function can be represen...
AbstractIn this paper, we address a fundamental problem related to the induction of Boolean logic: G...
This paper discusses a problem of recognition of the Boolean function's linearity. The article descr...
Boolean functions expressing some particular properties often appear in engineering practice. Theref...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
Abstract-A theory has been developed to calculate the Ra-demacher-Walsh t ransform f rom a cube a r ...
Affine equivalence of Boolean functions has various applications in computer science and modern cryp...
So far, there are no efficient algorithms to solve a problem of finding the low degree annihilators ...
AbstractIn this paper we consider four possible definitions for extending a partially defined Boolea...
The paper discusses the problem of recognizing the Boolean function linearity. A spectral method of ...
In this article, we study two representations of a Boolean function which are very important in the ...
Boolean functions are the mathematical basis of modern cryptographic algorithms. However, in practic...
We consider the problem of checking the generalized affine equivalence of two given Boolean function...
AbstractIn this paper we consider four possible definitions for extending a partially defined Boolea...