Add to ORKGWe compute the non-linearity of Boolean functions with Gröbner basis techniques. Moreover, we extend our approach to classify functions with maximum non-linearity
In this paper, the support of a Boolean function is used to establish some algebraic properties. The...
We present some upper bounds on the size of nonlinear codes and their restriction to systematic code...
Three important criteria for cryptographically strong Boolean functions are balance, nonlinearity, a...
We review and compare three algebraic methods to compute the nonlinearity of Boolean functions. Two ...
An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (AN...
The algebraic nonlinearity of an n-bit boolean function is defined as the degree of the polynomial f...
In this paper, a class of linear Boolean functions is analyzed. The Boolean function can be represen...
Boolean functions play an important role in the design and analysis of symmetric-key cryptosystems, ...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
We introduce the notion of nonhomomorphicity as an alternative criterion that forecasts nonlinear c...
Abstract. It is known that the symmetric Boolean functions with optimal nonlinearity are the quadrat...
Abstract Given two non-weakly k-normal Boolean functions on n variables a method is proposed to cons...
Provides the first comprehensive, unified presentation of the structural, algorithmic and applied as...
In 2005, [2] Philippe Guillot presented a new construction of Boolean functions using linear codes a...
Boolean function manipulation is an important component of computer science. This thesis presents r...
In this paper, the support of a Boolean function is used to establish some algebraic properties. The...
We present some upper bounds on the size of nonlinear codes and their restriction to systematic code...
Three important criteria for cryptographically strong Boolean functions are balance, nonlinearity, a...
We review and compare three algebraic methods to compute the nonlinearity of Boolean functions. Two ...
An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (AN...
The algebraic nonlinearity of an n-bit boolean function is defined as the degree of the polynomial f...
In this paper, a class of linear Boolean functions is analyzed. The Boolean function can be represen...
Boolean functions play an important role in the design and analysis of symmetric-key cryptosystems, ...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
We introduce the notion of nonhomomorphicity as an alternative criterion that forecasts nonlinear c...
Abstract. It is known that the symmetric Boolean functions with optimal nonlinearity are the quadrat...
Abstract Given two non-weakly k-normal Boolean functions on n variables a method is proposed to cons...
Provides the first comprehensive, unified presentation of the structural, algorithmic and applied as...
In 2005, [2] Philippe Guillot presented a new construction of Boolean functions using linear codes a...
Boolean function manipulation is an important component of computer science. This thesis presents r...
In this paper, the support of a Boolean function is used to establish some algebraic properties. The...
We present some upper bounds on the size of nonlinear codes and their restriction to systematic code...
Three important criteria for cryptographically strong Boolean functions are balance, nonlinearity, a...