Enumeration of boolean functions with a fixed number of affine products | Applied Discrete Mathematics. Supplement. 2015. № 8.

Enumeration of boolean functions with a fixed number of affine products

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.

Download file

Counter downloads: 260

Keywords

формула обращения Мёбиуса, аффинная классификация, двоичные функции, Mobius inversion, affine classification, Boolean function

Authors

Name	Organization	E-mail
Cheremushkin A. V.	Academy of Cryptography of the Russian Federation (Moscow)	avc238@mail.ru

Всего: 1

References

Tu Z. and Deng Y. Algebraic Immunity Hierarchy of Boolean Functions. Cryptology ePrint Archive, Report 2007/259, 2007. e-print.iacr.org. 6 p.

Черемушкин А. В. Методы аффинной и линейной классификации двоичных функций // Труды по дискретной математике. Т. 4. М.: Физматлит, 2001. С. 273-314.

Comtet M. L. Nombres de Stirling generaux et fonctions symmetriques // C. R. Acad. Sc. Paris. 1972. V. 275. Ser.A. P. 747-750.

Bender E. A. and Goldman J. R. On the application of the MObius inversion in combinatorial analysis // Amer. Math. Monthly. 1975. V.82. No. 8. P. 789-803.