Search for Boolean functions with excellent profiles in the rotation symmetric class

Kavut S., Maitra S., Yucel M. D.

IEEE TRANSACTIONS ON INFORMATION THEORY, vol.53, no.5, pp.1743-1751, 2007 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 53 Issue: 5
  • Publication Date: 2007
  • Doi Number: 10.1109/tit.2007.894696
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.1743-1751
  • Keywords: autocorrelation, Boolean functions, combinatorial problems, cryptography, heuristic search, nonlinearity, rotational symmetry, REED-MULLER CODE, COVERING RADIUS, NONLINEARITY, DESIGN, CONSTRUCTIONS, COSETS, BENT
  • Middle East Technical University Affiliated: No


For the first time Boolean functions on 9 variables having nonlinearity 241 are discovered, that remained as an open question in literature for almost three decades. Such functions are found by heuristic search in the space of rotation symmetric Boolean functions (RSBFs). This shows that there exist Boolean functions on n (odd) variables having non, linearity > 2(n-1) - 2 (n-1/2) if and only if n > 7. Using similar search technique, balanced Boolean functions on 9, 10, and 11 variables are attained having autocorrelation spectra with maximum absolute value < 2 [n/2]. On odd number of variables, earlier such functions were known for 15, 21 variables; there was no evidence of such functions at all on even number of variables. In certain cases, our functions can be affinely transformed to obtain first-order resiliency or first-order propagation characteristics. Moreover, 10 variable functions having first-order resiliency and nonlinearity 492 are presented that had been posed as an open question at Crypto 2000. The functions reported in this paper are discovered using a suitably modified steepest descent based iterative heuristic search in the RSBF class along with proper affine transformations. It seems elusive to get a construction technique to match such functions.