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 been studied for small degrees. In this talk we give an explicit characterization of generators of k-rotation monomial Boolean functions. These generators can be used to determine when a k-rotation monomial is a short cycle or a long one. We also use such generators to count the number of cycles for a given value of the degree and a given value of length. We also present a study on the affine equivalence of such monomials to determine whenever two k-rotation monomials are affine equivalent.
Place: Monzón 201
Hour: 10:30 a.m.