Characterization and affine equivalence of k-rotation symmetric Boolean functions.
Abstract: Rotation symmetric Boolean functions were introduced by Pieprzyk and Qu in 1999. They proved that these functions have efficient and secured cryptographic implementations. Later, in 2007, Kavut and Yucel found a function that exceed the Bent concatenation bound in this new class of functions. Concepts such as affine equivalence, Hamming weight, and nonlinearity have…