Geodesic
On the affinity level of Boolean functions
Diskretnaya Matematika, Tome 17 (2005) no. 4, pp. 98-107.

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

We study properties of the parameter of a Boolean function known as the affinity level, which characterises the efficiency of the linearisation method of solving systems of Boolean equations, and relations between this parameter and parameters characterising other properties of Boolean functions. 
@article{DM_2005_17_4_a8,
     author = {M. L. Buryakov and O. A. Logachev},
     title = {On the affinity level of {Boolean} functions},
     journal = {Diskretnaya Matematika},
     pages = {98--107},
     publisher = {mathdoc},
     volume = {17},
     number = {4},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2005_17_4_a8/}
}
TY  - JOUR
AU  - M. L. Buryakov
AU  - O. A. Logachev
TI  - On the affinity level of Boolean functions
JO  - Diskretnaya Matematika
PY  - 2005
SP  - 98
EP  - 107
VL  - 17
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2005_17_4_a8/
LA  - ru
ID  - DM_2005_17_4_a8
ER  - 
%0 Journal Article
%A M. L. Buryakov
%A O. A. Logachev
%T On the affinity level of Boolean functions
%J Diskretnaya Matematika
%D 2005
%P 98-107
%V 17
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2005_17_4_a8/
%G ru
%F DM_2005_17_4_a8
M. L. Buryakov; O. A. Logachev. On the affinity level of Boolean functions. Diskretnaya Matematika, Tome 17 (2005) no. 4, pp. 98-107. http://geodesic.mathdoc.fr/item/DM_2005_17_4_a8/

[1] Menezes A., van Oorschot P., Vanstone S., Handbook of applied cryptography, CRC Press, New York, 1997 | Zbl

[2] Courtois N., Pieprzyk J., “Cryptanalysis of block ciphers with overdefined systems of equations”, Lect. Note Comput. Sci., 2501, 2002, 267–287 | MR | Zbl

[3] Courtois N, Patarin J., “About the XL algorithm over GF(2)”, Lect. Note Comput. Sci., 2612, 2003, 141–157 | MR | Zbl

[4] Courtois N., Meier W., “Algebraic attacks on stream ciphers with linear feedback”, Lect. Notes Comput. Sci., 2656, 2003, 245–359 | MR

[5] Meier W., Pasalic E., Carlet C., “Algebraic attacks and decomposition of Boolean functions”, Lect. Notes Comput. Sci., 3027, 2004, 474–491 | MR | Zbl

[6] Logachev O. A., Salnikov A. A., Yaschenko V. V., “Korrelyatsionnaya immunnost i realnaya sekretnost”, Matematika i bezopasnost informatsionnykh tekhnologii, Materialy konferentsii v MGU 23–24 oktyabrya 2003 g., MTsNMO, Moskva, 2004, 165–171

[7] Logachev O. A., Salnikov A. A., Yaschenko V. V., Bulevy funktsii v teorii kodirovaniya i kriptologii, MTsNMO, Moskva, 2004

[8] Carlet C., Lect. Notes Comput. Sci., 2442, 2002, 549–564 | MR | Zbl

[9] Carlet C., “Two new classes of bent functions”, Lect. Notes Comput. Sci., 765, 1994, 77–101 | MR | Zbl

[10] Tarannikov Yu. V., “O korrelyatsionno-immunnykh i ustoichivykh bulevykh funktsiyakh”, Matem. voprosy kibernetiki, 11 (2002), 91–148 | MR

[11] Kharari F., Teoriya grafov, Mir, Moskva, 1973 | MR

[12] Logachev O. A., Salnikov A. A., Yaschenko V. V., “Kombiniruyuschie $k$-affinnye funktsii”, Matematika i bezopasnost informatsionnykh tekhnologii, Materialy konferentsii v MGU 23–24 oktyabrya 2003 g., MTsNMO, Moskva, 2004, 176–178