a recursive formula for weights of boolean rotation symmetric functions：布尔旋转对称函数的一个递推公式.pdfVIP

Discrete Applied Mathematics 160 (2012) 391–397 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: /locate/dam A recursive formula for weights of Boolean rotation symmetric functions Thomas W. Cusick ∗, Dan Padgett Department of Mathematics, University at Buffalo, 244 Mathematics Bldg., Buffalo, NY 14260, United States a r t i c l e i n f o a b s t r a c t Article history: For the last dozen years or so, there has been much research on the applications of rotation Received 8 June 2011 symmetric Boolean functions with n variables in cryptography. In particular, the Hamming Received in revised form 28 October 2011 weights of these functions have been studied, because knowledge of these weights is Accepted 4 November 2011 important if the functions are to be useful in cryptography. Only in 2009, in a paper by Available online 1 December 2011 Kim et al., there was a closed formula for the weights as a function of n obtained for some of these functions in the simplest case of quadratic functions. In this paper, we present Keywords: a method for recursively computing the weights of certain kinds of rotation symmetric Cryptography Boolean functions Boolean functions with arbitrary degree. Using some recent work of Cusick on the affine Hamming weight equivalence classes of certain cubic rotation symmetric functions, we obtain some