Discrete Functions

Enumeration of Boolean functions with a fixed number of affine products

A. V. Cheremushkin

Academy of Criptography of Russia, Moscow

Abstract: A recursive enumeration method for determining the number of Boolean functions with a fixed number of affine products and fixed function weights or nonlinearity degree is proposed.

Keywords: Boolean function, affine classification, Möbius inversion.

UDC: 519.719.1

DOI: 10.17223/2226308X/8/17