A constructive count of rotation symmetric functions

doi:10.1016/j.ipl.2003.09.004

Information Processing Letters

Volume 88, Issue 6, 31 December 2003, Pages 299-304

https://doi.org/10.1016/j.ipl.2003.09.004 Get rights and content

Abstract

In this paper we present a constructive detection of minimal monomials in the algebraic normal form of rotation symmetric Boolean functions (immune to circular translation of indices). This helps in constructing rotation symmetric Boolean functions by respecting the rules we present here.

References (4)

T.W. Cusick et al.
Fast evaluation, weights and nonlinearity of rotation-symmetric functions
Discrete Math.
(2002)
J. Pieprzyk et al.
Fast hashing and rotation-symmetric functions
J. Universal Comput. Sci.
(1999)

There are more references available in the full text version of this article.

Cited by (25)

Affine equivalence of cubic homogeneous rotation symmetric functions
2011, Information Sciences
Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The simplest case of quadratic rotation symmetric functions which are generated by cyclic permutations of the variables in a single monomial was only settled in 2009. This paper studies the much more complicated cubic case for such functions. A new concept of patterns is introduced, by means of which the structure of the smallest group G_n, whose action on the set of all such cubic functions in n variables gives the affine equivalence classes for these functions under permutation of the variables, is determined. We conjecture that the equivalence classes are the same if all nonsingular affine transformations, not just permutations, are allowed. Our method gives much more information about the equivalence classes; for example, in this paper we give a complete description of the equivalence classes when n is a prime or a power of 3.
On homogeneous rotation symmetric bent functions
2010, Discrete Applied Mathematics
Citation Excerpt :
In [6], Pieprzyk and Qu used RotS functions as the components in the rounds of a hashing algorithm. RotS functions are also used as the components in the round of hashing algorithms in MD4, MD5 and HAVAL (see [9]). The number of RotS functions is a small fraction of the total number of Boolean functions (see [10]) and the set contains functions with good cryptographic properties.
Results on rotation symmetric polynomials over GF(p)
2008, Information Sciences
A Lower Bound on the Constant in the Fourier Min-Entropy/Influence Conjecture
2022, arXiv
Constructing 1-resilient rotation symmetric functions over F<inf>p</inf> with q variables through special orthogonal arrays
2020, Advances in Mathematics of Communications
New Constructions of q-Variable Rotation Symmetric Resilient Functions Based on Latin Square Over GF(p)
2018, Tien Tzu Hsueh Pao/Acta Electronica Sinica

View all citing articles on Scopus

View full text

A constructive count of rotation symmetric functions

Abstract

Discrete Math.

Fast hashing and rotation-symmetric functions

J. Universal Comput. Sci.