Geodesic
New methods of investigation of perfectly balanced Boolean functions
Diskretnaya Matematika, Tome 21 (2009) no. 2, pp. 51-74 
O. A. Logachev; S. V. Smyshlyaev; V. V. Yashchenko. New methods of investigation of perfectly balanced Boolean functions. Diskretnaya Matematika, Tome 21 (2009) no. 2, pp. 51-74. http://geodesic.mathdoc.fr/item/DM_2009_21_2_a2/
@article{DM_2009_21_2_a2,
     author = {O. A. Logachev and S. V. Smyshlyaev and V. V. Yashchenko},
     title = {New methods of investigation of perfectly balanced {Boolean} functions},
     journal = {Diskretnaya Matematika},
     pages = {51--74},
     year = {2009},
     volume = {21},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2009_21_2_a2/}
}
TY  - JOUR
AU  - O. A. Logachev
AU  - S. V. Smyshlyaev
AU  - V. V. Yashchenko
TI  - New methods of investigation of perfectly balanced Boolean functions
JO  - Diskretnaya Matematika
PY  - 2009
SP  - 51
EP  - 74
VL  - 21
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DM_2009_21_2_a2/
LA  - ru
ID  - DM_2009_21_2_a2
ER  - 
%0 Journal Article
%A O. A. Logachev
%A S. V. Smyshlyaev
%A V. V. Yashchenko
%T New methods of investigation of perfectly balanced Boolean functions
%J Diskretnaya Matematika
%D 2009
%P 51-74
%V 21
%N 2
%U http://geodesic.mathdoc.fr/item/DM_2009_21_2_a2/
%G ru
%F DM_2009_21_2_a2

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

We consider new approaches to the investigation and introduce parameters for some new classes of perfectly balanced Boolean functions.

[1] Preparata F. P., “Convolutional transformations of binary sequences: Boolean functions and their resynchronizing properties”, IEEE Trans. Electron. Comput., 15:6 (1966), 898–909 | DOI

[2] Huffman D. A., “Canonical forms for information-lossless finite-state logical machines”, IRE Trans. Circuit Theory, 5 (1959), 41–59

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

[4] Anderson R. J., “Searching for the optimum correlation attack”, Lecture Notes Computer Sci., 1008, 1995, 137–143 | Zbl

[5] Sumarokov S. N., “Zaprety dvoichnykh funktsii i obratimost dlya odnogo klassa kodiruyuschikh ustroistv”, Obozrenie prikladnoi i promyshlennoi matematiki, 1:1 (1994), 33–55 | Zbl

[6] Golić D. J., “On the security of nonlinear filter generators”, Lecture Notes Computer Sci., 1039, 1996, 173–188

[7] Gouget A., Sibert H., “Revisiting correlation-immunity in filter generators”, Lecture Notes Computer Sci., 4876, 2007, 378–395 | Zbl

[8] Dichtl M., “On nonlinear filter generators”, Lecture Notes Computer Sci., 1267, 1997, 103–106

[9] Logachev O. A., “Ob odnom klasse sovershenno uravnoveshennykh bulevykh funktsii”, Materialy III Mezhdunarodnoi nauchnoi konferentsii po problemam bezopasnosti i protivodeistviya terrorizmu, MTsNMO, Moskva, 2008, 137–141

[10] Gill A., Introduction to the theory of finite-state machines, McGraw–Hill, New York, 1962 | MR

[11] Shennon K., “Matematicheskaya teoriya svyazi”, Raboty po teorii informatsii i kibernetike, IL, Moskva, 1963, 243–332