A constructive count of rotation symmetric functions
References (4)
- et al.
Fast evaluation, weights and nonlinearity of rotation-symmetric functions
Discrete Math.
(2002) - 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 SciencesOn homogeneous rotation symmetric bent functions
2010, Discrete Applied MathematicsCitation 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 SciencesConstructing 1-resilient rotation symmetric functions over F<inf>p</inf> with q variables through special orthogonal arrays
2020, Advances in Mathematics of CommunicationsNew Constructions of q-Variable Rotation Symmetric Resilient Functions Based on Latin Square Over GF(p)
2018, Tien Tzu Hsueh Pao/Acta Electronica Sinica
Copyright © 2003 Elsevier B.V. All rights reserved.