Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Boolean Functions with Affine Annihilators

View through CrossRef
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 an arbitrary boolean function and a vector space of the affine function’s annihilators. Based on this result, we have obtained the dependence of distance between an arbitrary boolean function and a set of functions with affine annihilators on the spectrum of given function. Also we have defined the necessary and sufficient condition for the arbitrary boolean function to be with an affine annihilator available. Using the results obtained we bounded an absolute value of Walsh-Hadamard coefficients.Also we suggested a method for boolean equations analysis, which is based on two known methods. Namely, we used an analysis using annihilators and an analysis using linear analogs. We have obtained an estimate of the success probability of the suggested method for an arbitrary boolean function. Also we proved that bent functions are the most resistant to this analysis.The results obtained can be used in analysis of boolean equations. Also obtained dependences can be used, for instance, to study bent functions and algebraic immunity of boolean functions.
Title: Boolean Functions with Affine Annihilators
Description:
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 an arbitrary boolean function and a vector space of the affine function’s annihilators.
Based on this result, we have obtained the dependence of distance between an arbitrary boolean function and a set of functions with affine annihilators on the spectrum of given function.
Also we have defined the necessary and sufficient condition for the arbitrary boolean function to be with an affine annihilator available.
Using the results obtained we bounded an absolute value of Walsh-Hadamard coefficients.
Also we suggested a method for boolean equations analysis, which is based on two known methods.
Namely, we used an analysis using annihilators and an analysis using linear analogs.
We have obtained an estimate of the success probability of the suggested method for an arbitrary boolean function.
Also we proved that bent functions are the most resistant to this analysis.
The results obtained can be used in analysis of boolean equations.
Also obtained dependences can be used, for instance, to study bent functions and algebraic immunity of boolean functions.

Related Results

Some Contributions to Boolean like near Rings
Some Contributions to Boolean like near Rings
In this paper we extend Foster’s Boolean-like ring to Near-rings. We introduce the concept of a Boolean like near-ring.  A near-ring N is said to be a Boolean-like near-ring if the...
Self-Affinity of Discs Under Glass-Cut Dissections
Self-Affinity of Discs Under Glass-Cut Dissections
Abstract A topological disc is called n-self-affine if it has a dissection into n affine images of itself. It is called n-gc-self-affine if the dissection is obtained by ...
Generalized co-annihilator of BL-algebras
Generalized co-annihilator of BL-algebras
Abstract In BL-algebras we introduce the concept of generalized co-annihilators as a generalization of coannihilator and the set of the form x-1F where F is a filter...
On annihilators in BL-algebras
On annihilators in BL-algebras
Abstract In the paper, we introduce the notion of annihilators in BL-algebras and investigate some related properties of them. We get that the ideal lattice (I(L), ⊆...
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
We study the problem of approximating pseudo-Boolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
Indeterminacy of Boolean Ring
Indeterminacy of Boolean Ring
Background A neutrosophic ring represents an algebraic generalization of the classical ring structure by introducing an indeterminacy element I , enabling the modeling of truth, fa...
The improved Levin’s algorithm for constrained probabilistic pseudo-Boolean functions
The improved Levin’s algorithm for constrained probabilistic pseudo-Boolean functions
The problem of finding “highly probable” approximations of Boolean functions consists in generating a list of all linear Boolean functions that agree with a given Boolean function ...
A Note on Boolean Like Algebras
A Note on Boolean Like Algebras
In this paper we develop on abstract system: viz Boolean-like algebra and prove that every Boolean  algebra is a Boolean-like algebra.  A necessary and sufficient condition for a B...

Back to Top