Geodesic
On the algorithm of detecting the essential arguments of random Boolean function
Matematičeskie voprosy kriptografii, Tome 6 (2015) no. 3, pp. 19-32 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Earlier author had presented the algorithm for detection of essential arguments of the binary vector-function given $N$ random uniformly distributed arguments and distorted values of the function. The dependence on $N$ of the probability that all (or almost all) essential arguments of Boolean function $f$ are detected on the first stage of the algorithm is studied. Cases of random symmetric and random threshold functions $f$ are considered. A review of some relevant papers is given. 
@article{MVK_2015_6_3_a1,
     author = {O. V. Denisov},
     title = {On the algorithm of detecting the essential arguments of random {Boolean} function},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {19--32},
     year = {2015},
     volume = {6},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MVK_2015_6_3_a1/}
}
TY  - JOUR
AU  - O. V. Denisov
TI  - On the algorithm of detecting the essential arguments of random Boolean function
JO  - Matematičeskie voprosy kriptografii
PY  - 2015
SP  - 19
EP  - 32
VL  - 6
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MVK_2015_6_3_a1/
LA  - ru
ID  - MVK_2015_6_3_a1
ER  - 
%0 Journal Article
%A O. V. Denisov
%T On the algorithm of detecting the essential arguments of random Boolean function
%J Matematičeskie voprosy kriptografii
%D 2015
%P 19-32
%V 6
%N 3
%U http://geodesic.mathdoc.fr/item/MVK_2015_6_3_a1/
%G ru
%F MVK_2015_6_3_a1
O. V. Denisov. On the algorithm of detecting the essential arguments of random Boolean function. Matematičeskie voprosy kriptografii, Tome 6 (2015) no. 3, pp. 19-32. http://geodesic.mathdoc.fr/item/MVK_2015_6_3_a1/

[1] Ambrosimov A. S., “Svoistva bent-funktsii $q$-znachnoi logiki nad konechnymi polyami”, Diskretnaya matematika, 6:3 (1994), 50–60 | MR | Zbl

[2] Borovkov A. A., Teoriya veroyatnostei, Editorial URSS, M., 1999, 472 pp. | MR

[3] Viktorova I. I., Leontovich A. M., “O chisle proverok dlya opredeleniya znachimykh peremennykh bulevoi funktsii”, Problemy peredachi informatsii, 14:4 (1978), 85–97 | MR | Zbl

[4] Denisov O. V., “Statisticheskaya otsenka mnozhestva suschestvennykh argumentov dvoichnoi vektor-funktsii s iskazhennymi znacheniyami”, Matematicheskie voprosy kriptografii, 5:4 (2014), 41–61

[5] Ivchenko G. I., Medvedev Yu. I., Mironova V. A., “Analiz spektra simmetricheskikh bulevykh funktsii”, Matematicheskie voprosy kriptografii, 4:1 (2013), 59–76

[6] Malyutov M. B., “O randomizirovannom planirovanii otseivayuschikh eksperimentov”, Planirovanie i avtomatizatsiya v nauchnykh issledovaniyakh, Sb., Sov. radio, M., 1974, 60–72

[7] Malyutov M. B., Tsitovich I. I., “Posledovatelnyi poisk suschestvennykh peremennykh neizvestnoi funktsii”, Problemy peredachi informatsii, 33:4 (1997), 88–107 | MR | Zbl

[8] Tsitovich I. I., “Posledovatelnyi plan dlya opredeleniya znachimykh peremennykh bulevskoi funktsii”, Analiz sistem informatiki, Sb., Nauka, M., 1991, 10–16

[9] Shabanin O. V., “O slozhnosti diz'yunktivnoi normalnoi formy porogovykh funktsii”, Diskretnaya matematika, 12:2 (2000), 85–92 | DOI | MR | Zbl

[10] Erdesh P., Spenser Dzh., Veroyatnostnye metody v kombinatorike, Mir, M., 1976, 131 pp. | MR

[11] Siegenthaler T., “Descrypting a class of stream ciphers using ciphertext only”, IEEE Trans. Computers, 34:1 (1985), 81–85 | DOI