Geodesic
Boolean functions without prediction
Diskretnaya Matematika, Tome 23 (2011) no. 1, pp. 102-118.

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

We study properties of Boolean functions with a finite-length barrier and suggest a criterion for a function to possess a barrier. We introduce the notion of a Boolean function without prediction which describes certain positive cryptographic properties of the corresponding transformations of binary sequences. We suggest a criterion for a Boolean function to belong to the class of functions without prediction. 
@article{DM_2011_23_1_a8,
     author = {S. V. Smyshlyaev},
     title = {Boolean functions without prediction},
     journal = {Diskretnaya Matematika},
     pages = {102--118},
     publisher = {mathdoc},
     volume = {23},
     number = {1},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2011_23_1_a8/}
}
TY  - JOUR
AU  - S. V. Smyshlyaev
TI  - Boolean functions without prediction
JO  - Diskretnaya Matematika
PY  - 2011
SP  - 102
EP  - 118
VL  - 23
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2011_23_1_a8/
LA  - ru
ID  - DM_2011_23_1_a8
ER  - 
%0 Journal Article
%A S. V. Smyshlyaev
%T Boolean functions without prediction
%J Diskretnaya Matematika
%D 2011
%P 102-118
%V 23
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2011_23_1_a8/
%G ru
%F DM_2011_23_1_a8
S. V. Smyshlyaev. Boolean functions without prediction. Diskretnaya Matematika, Tome 23 (2011) no. 1, pp. 102-118. http://geodesic.mathdoc.fr/item/DM_2011_23_1_a8/

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

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

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

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

[5] Smyshlyaev S. V., “O nekotorykh svoistvakh sovershenno uravnoveshennykh bulevykh funktsii”, Materialy 4-i Mezhdunarodnoi nauchnoi konferentsii po problemam bezopasnosti i protivodeistviya terrorizmu, MTsNMO, Moskva, 2009, 57–64

[6] Smyshlyaev S. V., “O sovershenno uravnoveshennykh bulevykh funktsiyakh bez barera”, Materialy 8-i Mezhdunarodnoi nauchnoi konferentsii “Diskretnye modeli v teorii upravlyayuschikh sistem”, MAKS Press, Moskva, 278–284

[7] Smyshlyaev S. V., “Barery sovershenno uravnoveshennykh bulevykh funktsii”, Diskretnaya matematika, 22:2 (2010), 66–79 | MR | Zbl

[8] Smyshlyaev S. V., “O preobrazovanii dvoichnykh posledovatelnostei s pomoschyu sovershenno uravnoveshennykh bulevykh funktsii”, Materialy 5-i Mezhdunarodnoi nauchnoi konferentsii po problemam bezopasnosti i protivodeistviya terrorizmu, MTsNMO, Moskva, 2010, 31–41

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