In this paper, we present theoretical constructions of Rotation Symmetric Boolean Functions (RSBFs) on odd number of variables with the maximum possible algebraic immunity. To get high nonlinearity, we generalize our construction to a search technique in the RSBF class. We present RSBFs with the maximum algebraic immunity and high nonlinearity for odd number of variables. We also study the RSBFs on even number of variables for max-imum algebraic immunity
AbstractRotation symmetric (RotS) Boolean functions have been used as components of different crypto...
The existence of 9-variable Boolean functions having nonlinearity strictly greater than 240 has been...
We introduce a steepest-descent-like search algorithm for the design of Boolean functions, yielding ...
In this paper we present a theoretical construction of Rotation Symmetric Boolean Functions (RSBFs) ...
AbstractIn this paper, we study the construction of Rotation Symmetric Boolean Functions (RSBFs) whi...
AbstractIn this paper, we study the construction of Rotation Symmetric Boolean Functions (RSBFs) whi...
In this paper, it is shown that an $n$-variable rotation symmetric Boolean function $f$ with $n$ eve...
For the first time Boolean functions on 9 variables having nonlinearity 241 are discovered, that rem...
AbstractRotation symmetric Boolean functions have important applications in the design of cryptograp...
Rotation symmetric Boolean functions have important applications in the design of cryptographic algo...
For the first time we find Boolean functions on 9 variables having nonlinearity 241, that remained a...
The class of Rotation Symmetric Boolean Functions (RSBFs) has received serious attention in searchin...
The class of Rotation Symmetric Boolean Functions (RSBFs) has received serious attention recently i...
AbstractRotation symmetric (RotS) Boolean functions have been used as components of different crypto...
Rotation symmetric (RotS) Boolean functions have been used as components of dif-ferent cryptosystems...
AbstractRotation symmetric (RotS) Boolean functions have been used as components of different crypto...
The existence of 9-variable Boolean functions having nonlinearity strictly greater than 240 has been...
We introduce a steepest-descent-like search algorithm for the design of Boolean functions, yielding ...
In this paper we present a theoretical construction of Rotation Symmetric Boolean Functions (RSBFs) ...
AbstractIn this paper, we study the construction of Rotation Symmetric Boolean Functions (RSBFs) whi...
AbstractIn this paper, we study the construction of Rotation Symmetric Boolean Functions (RSBFs) whi...
In this paper, it is shown that an $n$-variable rotation symmetric Boolean function $f$ with $n$ eve...
For the first time Boolean functions on 9 variables having nonlinearity 241 are discovered, that rem...
AbstractRotation symmetric Boolean functions have important applications in the design of cryptograp...
Rotation symmetric Boolean functions have important applications in the design of cryptographic algo...
For the first time we find Boolean functions on 9 variables having nonlinearity 241, that remained a...
The class of Rotation Symmetric Boolean Functions (RSBFs) has received serious attention in searchin...
The class of Rotation Symmetric Boolean Functions (RSBFs) has received serious attention recently i...
AbstractRotation symmetric (RotS) Boolean functions have been used as components of different crypto...
Rotation symmetric (RotS) Boolean functions have been used as components of dif-ferent cryptosystems...
AbstractRotation symmetric (RotS) Boolean functions have been used as components of different crypto...
The existence of 9-variable Boolean functions having nonlinearity strictly greater than 240 has been...
We introduce a steepest-descent-like search algorithm for the design of Boolean functions, yielding ...