This article is cited in 2 papers

The relationship between the level of affinity and cryptographic parameters of Boolean functions

M. L. Buryakov


Abstract: We consider the relations between the level of affinity and other cryptographic parameters of Boolean functions such as nonlinearity, the order of correlation, and algebraic immunity. It is proved that the problem of finding the level of affinity for certain class of functions is an $NP$-hard problem.

UDC: 519.7

Received: 11.12.2007

DOI: 10.4213/dm999

 English version: Discrete Mathematics and Applications, 2008, 18:3, 227–238

Bibliographic databases:

• 
• 
• 
•