The relationship between the level of affinity and cryptographic parameters of Boolean functions
Diskretnaya Matematika, Tome 20 (2008) no. 2, pp. 3-14

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
@article{DM_2008_20_2_a0,
     author = {M. L. Buryakov},
     title = {The relationship between the level of affinity and cryptographic parameters of {Boolean} functions},
     journal = {Diskretnaya Matematika},
     pages = {3--14},
     publisher = {mathdoc},
     volume = {20},
     number = {2},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2008_20_2_a0/}
}
TY  - JOUR
AU  - M. L. Buryakov
TI  - The relationship between the level of affinity and cryptographic parameters of Boolean functions
JO  - Diskretnaya Matematika
PY  - 2008
SP  - 3
EP  - 14
VL  - 20
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2008_20_2_a0/
LA  - ru
ID  - DM_2008_20_2_a0
ER  - 
%0 Journal Article
%A M. L. Buryakov
%T The relationship between the level of affinity and cryptographic parameters of Boolean functions
%J Diskretnaya Matematika
%D 2008
%P 3-14
%V 20
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2008_20_2_a0/
%G ru
%F DM_2008_20_2_a0
M. L. Buryakov. The relationship between the level of affinity and cryptographic parameters of Boolean functions. Diskretnaya Matematika, Tome 20 (2008) no. 2, pp. 3-14. http://geodesic.mathdoc.fr/item/DM_2008_20_2_a0/