Zobrazeno 1 - 10 of 34 pro vyhledávání: '"A. V. Babash"'
1
Akademický článek
Attacks on the Random Gamming Code
Autor: A. V. Babash
Publikováno v: Matematika i Matematičeskoe Modelirovanie, Vol 0, Iss 6, Pp 35-58 (2020)
In 1917, Hilbert Vernam patented a top-secret encryption scheme, which at first was called a one-time notepad and later a Vernam cipher. At the time that Vernam proposed this scheme, there was no evidence that it was completely secret, since, in fact
Externí odkaz: https://doaj.org/article/a6e1df2644e347a59d53595c401b2813
Zobrazit plný text záznamu
2
Akademický článek
Classifcation of events in information security systems based on neural networks
Autor: A. A. Mikryukov, A. V. Babash, V. A. Sizov
Publikováno v: Открытое образование (Москва), Vol 23, Iss 1, Pp 57-63 (2019)
Purpose of the research. The aim of the study is to increase the effectiveness of information security and to enhance accuracy and promptness of the classification of security events, security incidents, and threats in information security systems. T
Externí odkaz: https://doaj.org/article/640d92684bc24bcfb25defc271d590ab
Zobrazit plný text záznamu
7
Визначення статичного моменту тертя при пресуванні зразка з одночасним крученням
Autor: V. O. Kvashnin, A. V. Babash, A. N. Yakovlev
Publikováno v: HERALD of the Donbass State Engineering Academy. :71-76
Квашнін В. О., Бабаш А. В., Яковлєв О. М. Визначення статичного моменту тертя при пресуванні зразка з одночасним крученням // Вісник ДДМА. – 2
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::f325e1ad26c53afd9446b27bc7e1efb4
https://doi.org/10.37142/1993-8222/2019-2(46)71
Zobrazit plný text záznamu
8
Security Evaluation of a Brute-force Attack on a Cipher Using a Statistical Criterion for Plaintext
Autor: A. A. Mikryukov, A. V. Babash, V. A. Sizov
Publikováno v: Automatic Control and Computer Sciences. 53:39-44
The paper presents calculations of the amount of effort and the reliability of the method of brute-force attack on a cipher using a statistical criterion for plaintexts, which has type 1 and type 2 errors. Calculated values of parameters of the discu
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::819112e26baf55d64e43cbdb500199c2
https://doi.org/10.3103/s0146411619010036
Zobrazit plný text záznamu
10
Attainable upper estimate of the degree of distinguishability of a connected permutation automaton
Autor: A. V. Babash
Publikováno v: Automatic Control and Computer Sciences. 50:749-758
In this work, we yield an attainable upper estimate of the degree of distinguishability of a connected permutation automaton with an assigned diameter.
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c7ef4b95998abbddd10a780d42afdd8e
https://doi.org/10.3103/s0146411616080034
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje