This paper presents a construction for a class of 1-resilient Boolean functions with optimal algebraic immunity on an even number of variables by dividing them into two correlation classes, i.e. equivalence classes. From which, a nontrivial pair of functions has been found by applying the generating matrix. For $n$ is small (e.g. $n=6$), a part of these functions achieve almost optimal nonlinearity. Apart from their good nonlinearity, the functions reach Siegenthaler\u27s \cite{Siegenthaler} upper bound of algebraic degree. Furthermore, a class of 1-resilient functions on any number $n>2$ of variables with at least sub-optimal algebraic immunity is provided
In the last decade, algebraic and fast algebraic attacks are regarded as the most successful attacks...
In recent years a cryptographic community is paying a lot of attention to the constructions of so ca...
Cryptographically strong Boolean functions play an imperative role in the design of almost every mod...
This paper presents a construction for a class of 1-resilient Boolean functions with optimal algebra...
In this paper, we propose a class of $2k$-variable Boolean functions which have optimal algebraic de...
In this paper, we present a class of $2k$-variable balanced Boolean functions and a class of $2k$-v...
In this paper, we propose a class of 1-resilient Boolean function with optimal algebraic degree and ...
AbstractIn this paper, we construct a class of 2k-variable Boolean functions which have optimal alge...
Abstract. In this paper, we investigate the problem of obtaining new construction methods for resili...
Boolean functions are used as nonlinear combining functions in certain stream ciphers. A Boolean fun...
Boolean functions are used as nonlinear combining functions in certain stream ciphers. A Boolean fun...
Using simulated annealing, we derive several equivalence classes of balanced Boolean functions with ...
This paper gives a construction method which can get a large class of Boolean functions with maximum...
Because of the recent algebraic attacks, a high algebraic immunity is now an absolutely necessary (b...
AbstractIn this paper, we construct a class of 2k-variable Boolean functions which have optimal alge...
In the last decade, algebraic and fast algebraic attacks are regarded as the most successful attacks...
In recent years a cryptographic community is paying a lot of attention to the constructions of so ca...
Cryptographically strong Boolean functions play an imperative role in the design of almost every mod...
This paper presents a construction for a class of 1-resilient Boolean functions with optimal algebra...
In this paper, we propose a class of $2k$-variable Boolean functions which have optimal algebraic de...
In this paper, we present a class of $2k$-variable balanced Boolean functions and a class of $2k$-v...
In this paper, we propose a class of 1-resilient Boolean function with optimal algebraic degree and ...
AbstractIn this paper, we construct a class of 2k-variable Boolean functions which have optimal alge...
Abstract. In this paper, we investigate the problem of obtaining new construction methods for resili...
Boolean functions are used as nonlinear combining functions in certain stream ciphers. A Boolean fun...
Boolean functions are used as nonlinear combining functions in certain stream ciphers. A Boolean fun...
Using simulated annealing, we derive several equivalence classes of balanced Boolean functions with ...
This paper gives a construction method which can get a large class of Boolean functions with maximum...
Because of the recent algebraic attacks, a high algebraic immunity is now an absolutely necessary (b...
AbstractIn this paper, we construct a class of 2k-variable Boolean functions which have optimal alge...
In the last decade, algebraic and fast algebraic attacks are regarded as the most successful attacks...
In recent years a cryptographic community is paying a lot of attention to the constructions of so ca...
Cryptographically strong Boolean functions play an imperative role in the design of almost every mod...