Geodesic
Connections between some parameters of perfectly balanced Boolean functions
Prikladnaâ diskretnaâ matematika, no. 2 (2013), pp. 19-25.

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

For the perfectly balanced Boolean functions with barriers, some relations between their parameters are proved. Particularly, general results are obtained concerning the properties of the polynomials of these functions. They can be used to get new bounds for the number of inverse functions for an arbitrary function with barrier.
Keywords: perfectly balanced functions, functions with barriers, cryptography. 
@article{PDM_2013_2_a2,
     author = {S. V. Smyshlyaev},
     title = {Connections between some parameters of perfectly balanced {Boolean} functions},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {19--25},
     publisher = {mathdoc},
     number = {2},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2013_2_a2/}
}
TY  - JOUR
AU  - S. V. Smyshlyaev
TI  - Connections between some parameters of perfectly balanced Boolean functions
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2013
SP  - 19
EP  - 25
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2013_2_a2/
LA  - ru
ID  - PDM_2013_2_a2
ER  - 
%0 Journal Article
%A S. V. Smyshlyaev
%T Connections between some parameters of perfectly balanced Boolean functions
%J Prikladnaâ diskretnaâ matematika
%D 2013
%P 19-25
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2013_2_a2/
%G ru
%F PDM_2013_2_a2
S. V. Smyshlyaev. Connections between some parameters of perfectly balanced Boolean functions. Prikladnaâ diskretnaâ matematika, no. 2 (2013), pp. 19-25. http://geodesic.mathdoc.fr/item/PDM_2013_2_a2/

[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] Logachev O. A., Salnikov A. A., Smyshlyaev S. V., Yaschenko V. V., Bulevy funktsii v teorii kodirovaniya i kriptologii, 2-e izd., MTsNMO, M., 2012

[3] Golić J. Dj., “On the security of nonlinear filter generators”, LNCS, 1039, 1996, 173–188

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

[5] Smyshlyaev S. V., “Perfectly balanced Boolean functions and Golić conjecture”, J. Cryptology, 25:3 (2012), 464–483 | DOI | MR | Zbl

[6] Logachev O. A., Smyshlyaev S. V., Yaschenko V. V., “Novye metody izucheniya sovershenno uravnoveshennykh bulevykh funktsii”, Diskretnaya matematika, 21:2 (2009), 51–74 | DOI | MR | Zbl

[7] Smyshlyaev S. V., “Bulevy funktsii bez predskazyvaniya”, Diskretnaya matematika, 23:1 (2011), 102–118 | DOI | MR

[8] Smyshlyaev S. V., “O svoistvakh bulevykh funktsii bez predskazyvaniya”, Materialy Shestoi Mezhdunar. nauch. konf. po problemam bezopasnosti i protivodeistviya terrorizmu (MGU im. M. V. Lomonosova, Moskva, 11–12 noyabrya 2010), MTsNMO, M., 2011, 47–56

[9] Lai X., Massey J., “Some connections between scramblers and invertible automata”, Proc. 1988 Beijing Int. Workshop on Info. Theory (Beijing, China, July 4–8, 1988), DI-5.1–DI-5.5

[10] Smyshlyaev S. V., “O preobrazovanii dvoichnykh posledovatelnostei s pomoschyu sovershenno uravnoveshennykh bulevykh funktsii”, Materialy Pyatoi Mezhdunar. nauch. konf. po problemam bezopasnosti i protivodeistviya terrorizmu (MGU im. M. V. Lomonosova, Moskva, 29–30 oktyabrya 2009), MTsNMO, M., 2010, 31–41

[11] Smyshlyaev S. V., “O kriptograficheskikh slabostyakh nekotorykh klassov preobrazovanii dvoichnykh posledovatelnostei”, Prikladnaya diskretnaya matematika, 2010, no. 1(7), 5–15