Statistical criterion, physical random number generator, quantum random number generator, entropy, probabilistic scheme, statistical performance improvement unit.
Subject:
Statistical testing of data, development and analysis of algorithms for converting polynomial schemes used as blocks for improving statistical characteristics, research of physical random number generators, including those having a quantum nature. Research of information-theoretical characteristics of random objects.
Main publications:
A. M. Zubkov, V. O. Mironkin, “Raspredelenie dliny otrezka aperiodichnosti v grafe $k$-kratnoi iteratsii sluchainogo ravnoveroyatnogo otobrazheniya”, Matematicheskie voprosy kriptografii, 8:4 (2017), 63–74
V. O. Mironkin, V. G. Mikhailov, “O mnozhestve obrazov $k$-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Matematicheskie voprosy kriptografii, 9:3 (2018), 99–108
V. O. Mironkin, “Sloi v grafe $k$-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Matematicheskie voprosy kriptografii, 10:1 (2019), 73–82
V. O. Mironkin, “Raspredelenie dliny otrezka aperiodichnosti v grafe kompozitsii nezavisimykh ravnoveroyatnykh sluchainykh otobrazhenii, Matematicheskie voprosy kriptografii”, Matematicheskie voprosy kriptografii, 10:3 (2019), 89–99
V. O. Mironkin, “Ob obrazakh i proobrazakh v grafe kompozitsii nezavisimykh ravnoveroyatnykh sluchainykh otobrazhenii”, Prikladnaya diskretnaya matematika, 2020, № 49, 5–17
D. S. Bogdanov, A. S. Logachev, V. O. Mironkin, “Teoretiko-veroyatnostnye modeli fizicheskikh generatorov sluchainykh chisel”, Problemy informatsionnoi bezopasnosti. Kompyuternye sistemy, 61:3 (2024), 9–19https://jisp.ru/
2.
A. S. Logachev, V. O. Mironkin, “On the influence of probabilistic characteristics of discrete sources forming cryptographic keys on the practical secrecy of the key”, Prikl. Diskr. Mat., 2024, no. 65, 66–83
3.
V. O. Mironkin, V. V. Sheikin, G. L. Astvatsatryan, G. G. Kochkonyan, M. A. Surkov, “Ob odnom podkhode k postroeniyu polnykh kodovykh derevev”, Sovremennaya nauka: Aktualnye problemy teorii i praktiki, 2024, no. 9, 76–79http://www.nauteh-journal.ru/files/dc4e4533-fdaa-4175-bf82-6c9c0724f68b
2023
4.
V. O. Mironkin, “On the distribution of cycle lengths in the graph of $k$-multiple iteration of the uniform random substitution”, Prikl. Diskr. Mat., 2023, no. 62, 5–12
D. S. Bogdanov, A. S. Logachev, V. O. Mironkin, “Ob obobschenii odnogo algoritma formirovaniya ravnoveroyatnykh posledovatelnostei proizvolnogo modulya na osnove realizatsii ravnoveroyatnoi polinomialnoi skhemy”, Obozrenie prikladnoi i promyshlennoi matematiki (Dagomys, 19-30 sentyabrya 2022 g.), 29, Redaktsiya zhurnala “OPiPM”, Moskva, 2022, 181–185http://tvp.ru/conferen/vsppmXXIII_shkXXVI/vends029.pdf
7.
V. O. Mironkin, A. B. Chukhno, “O primenenii neravenstva Mallousa pri testirovanii chislovykh posledovatelnostei”, Obozrenie prikladnoi i promyshlennoi matematiki (19–30 sentyabrya 2022 g., Sochi), 29, Redaktsiya zhurnala “OPiPM”, 2022, 294—296http://tvp.ru/conferen/vsppmXXIII_shkXXVI/vends006.pdf
2021
8.
A. A. Karpov, V. O. Mironkin, M. M. Mikhailov, “Ob entropiinykh kharakteristikakh posledovatelnoi protsedury oprobovaniya elementov polinomialnoi skhemy”, Obozrenie prikladnoi i promyshlennoi matematiki, 28:1 (2021), 9–12http://tvp.ru/conferen/vsppmXXII_shkXXV_nzpmsIV/pkids009.pdf
9.
V. O. Mironkin, “Ob algoritme formirovaniya ravnoveroyatnykh posledovatelnostei proizvolnogo modulya na osnove skhemy nezavisimykh ravnoveroyatnykh ispytanii Bernulli”, Obozrenie prikladnoi i promyshlennoi matematiki, 28:1 (2021), 12–14http://tvp.ru/conferen/vsppmXXII_shkXXV_nzpmsIV/pkids008.pdf
10.
V. O. Mironkin, N. A. Yurasov, “K voprosu o primenimosti statistik mery «khi-kvadrat» v zadache opredeleniya parametrov blochnykh algoritmov shifrovaniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 28:1 (2021) http://tvp.ru/conferen/vsppmXXII_shkXXV_nzpmsIV/pkids007.pdf
2020
11.
V. O. Mironkin, “Layers in a graph of the composition of independent uniform random mappings”, Mat. Vopr. Kriptogr., 11:1 (2020), 101–114
12.
V. O. Mironkin, “On images and pre-images in a graph of the composition of independent uniform random mappings”, Prikl. Diskr. Mat., 2020, no. 49, 5–17
13.
V. O. Mironkin, M. M. Mikhailov, “Ob entropii posledovatelnoi protsedury oprobovaniya diskretnoi veroyatnostnoi skhemy”, Obozrenie prikladnoi i promyshlennoi matematiki, 27:1 (2020), 76–79
14.
D. S. Bogdanov, V. O. Mironkin, “O trudoemkosti proverki kachestva klassifikatorov”, Obozrenie prikladnoi i promyshlennoi matematiki, 27:3 (2020), 258–261
2019
15.
V. O. Mironkin, “Layers of the graph of $k$-fold iteration of the uniform random mapping”, Mat. Vopr. Kriptogr., 10:1 (2019), 73–82
16.
D. S. Bogdanov, V. O. Mironkin, “Data recovery for a neural network-based biometric authentication scheme”, Matem. vopr. kriptogr., 10:2 (2019), 61–74
V. O. Mironkin, “Distribution of the length of aperiodicity segment in the graph of independent uniform random mappings composition”, Mat. Vopr. Kriptogr., 10:3 (2019), 89–99
2021
18.
V. O. Mironkin, “Collisions and incidence of vertices and components in the graph of $k$-fold iteration of the uniform random mapping”, Discrete Math. Appl., 31:4 (2021), 259–269
2018
19.
V. O. Mironkin, “Ob odnoi teoretiko-veroyatnostnoi modeli Sponge-konstruktsii”, Obozrenie prikladnoi i promyshlennoi matematiki, 25:1 (2018), 3–8
20.
D. S. Bogdanov, V. O. Mironkin, “O kolliziyakh otobrazhenii, postroennykh na osnove sluchainoi podstanovki”, Obozrenie prikladnoi i promyshlennoi matematiki, 25:1 (2018), 64–66
21.
V. O. Mironkin, M. I. Urusov, “O kolliziyakh derevev Merkla”, Obozrenie prikladnoi i promyshlennoi matematiki, 25:1 (2018), 84–88
22.
F. A. Dali, V. O. Mironkin, “O drevovidnykh rezhimakh raboty khesh-funktsii”, Problemy informatsionnoi bezopasnosti. Kompyuternye sistemy, 2018, no. 1, 113–121 , SPbPU, SPb.
23.
V. O. Mironkin, A. B. Chukhno, “Ob odnom obobschenii paradoksa «dnei rozhdeniya»”, Problemy informatsionnoi bezopasnosti. Kompyuternye sistemy, 2018, no. 2, 69–73 , SPbPU, SPb.
24.
V. O. Mironkin, V. G. Mikhailov, “On the sets of images of $k$-fold iteration of uniform random mapping”, Mat. Vopr. Kriptogr., 9:3 (2018), 99–108
25.
D. S. Bogdanov, F. A. Dali, V. O. Mironkin, “Sravnitelnyi analiz FT-rezhima s nekotorymi drevovidnymi rezhimami vyrabotki khesh-koda”, Obozrenie prikladnoi i promyshlennoi matematiki, 25:3 (2018), 229–232
26.
S. S. Migalin, V. O. Mironkin, “Ob entropii iskhodnykh kodov programm v C++”, Obozrenie prikladnoi i promyshlennoi matematiki, 25:3 (2018), 260–265
27.
V. O. Mironkin, A. A. Smirnova, “O sdvigovykh svoistvakh nekotorykh algebraicheskikh operatsii”, Obozrenie prikladnoi i promyshlennoi matematiki, 25:3 (2018), 265–267
28.
D. S. Bogdanov, F. A. Dali, V. O. Mironkin, “Ob universalnom drevovidnom rezhime vyrabotki khesh-koda”, Sovremennye informatsionnye tekhnologii i IT-obrazovanie, 14:2 (2018), 419-425http://sitito.cs.msu.ru/index.php/SITITO/article/view/375
29.
V. O. Mironkin, I. S. Timokhin, “O nekotorykh funktsionalnykh i chislennykh kharakteristikakh drevovidnykh rezhimov raboty khesh-funktsii”, Obozrenie prikladnoi i promyshlennoi matematiki, 25:2 (2018), 103–112
30.
V. O. Mironkin, “On estimations of distribution of the length of aperiodicity segment in the graph of $k$-fold iteration of uniform random mapping”, Prikl. Diskr. Mat., 2018, no. 42, 6–17
2017
31.
G. B. Marshalko, V. O. Mironkin, “Geometricheskii metod analiza odnogo neirosetevogo algoritma simmetrichnogo shifrovaniya”, Problemy informatsionnoi bezopasnosti. Kompyuternye sistemy, 2017, no. 1, 43–49
32.
F. A. Dali, V. O. Mironkin, “Obzor podkhodov k postroeniyu drevovidnykh rezhimov raboty nekotorykh khesh-funktsii”, Problemy informatsionnoi bezopasnosti. Kompyuternye sistemy, 2017, no. 2, 46–55
33.
F. A. Dali, V. O. Mironkin, “O nekotorykh modelyakh drevovidnogo kheshirovaniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 24:4 (2017), 330–334 , OPiPM, M.
34.
T. D. Vorontsova, V. O. Mironkin, “Ob entropii letopisnykh tekstov”, Obozrenie prikladnoi i promyshlennoi matematiki, 24:4 (2017), 352–355 , OPiPM, M.
35.
V. O. Mironkin, A. B. Chukhno, “Zadacha o $t$-kolliziyakh dlya sluchainogo otobrazheniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 24:4 (2017), 355–357 , OPiPM, M.
36.
F. A. Dali, G. B. Marshalko, V. O. Mironkin, “O sdvigovykh svoistvakh algoritma «2-GOST»”, Problemy informatsionnoi bezopasnosti. Kompyuternye sistemy, 2017, no. 3, 87–90 , SPbPU, SPb.
37.
A. M. Zubkov, V. O. Mironkin, “Distribution of the length of aperiodicity segment in the graph of $k$-fold iteration of uniform random mapping”, Mat. Vopr. Kriptogr., 8:4 (2017), 63–74
2016
38.
N. V. Vilboa, A. B. Los, V. O. Mironkin, “Ob issledovanii informatsionnykh kharakteristik estestvennykh yazykov”, Obozrenie prikladnoi i promyshlennoi matematiki, 23:1 (2016), 3–16
39.
V. O. Mironkin, “Ob osobennostyakh stroeniya grafa stepeni sluchainogo otobrazheniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 23:1 (2016), 57–62
40.
F. A. Dali, G. B. Marshalko, V. O. Mironkin, “Rotational analysis of 2-GOST”, Obozrenie prikladnoi i promyshlennoi matematiki, 23:2 (2016), 163–165
41.
F. A. Dali, V. O. Mironkin, “O veroyatnostnykh kharakteristikakh odnogo klassa modelei drevovidnogo kheshirovaniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 23:4 (2016), 345–347
42.
G. B. Marshalko, V. O. Mironkin, “O svoistvakh odnogo neirosetevogo algoritmasimmetrichnogo shifrovaniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 23:5 (2016), 474–476 , OPiPM, M.
2015
43.
V. O. Mironkin, “Veroyatnostnye kharakteristiki sloev v grafe sluchainogo otobrazheniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 22:1 (2015), 80–82
44.
V. O. Mironkin, “Veroyatnost kollizii dvukh sluchainykh tochek dlya stepeni sluchainogo otobrazheniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 22:4 (2015), 403–409
45.
V. O. Mironkin, “Sovmestnaya veroyatnost dlin otrezkov aperiodichnosti dvukh vershin v grafe stepeni sluchainogo otobrazheniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 22:4 (2015), 482–484
46.
V. O. Mironkin, “O nekotorykh veroyatnostnykh kharakteristikakh algoritma vyrabotki klyucha «CRYPTOPRO KEY MESHING»”, Problemy informatsionnoi bezopasnosti. Kompyuternye sistemy, 2015, no. 4, 140–146
47.
N. V. Vilboa, V. O. Mironkin, “Issledovanie informatsionnykh kharakteristik estesstvennykh yazykov”, Obozrenie prikladnoi i promyshlennoi matematiki, 22:5 (2015), 569–572 , OPiPM, M.
2014
48.
V. O. Mironkin, “Issledovanie svoistv i kharakteristik stepeni sluchainogo otobrazheniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 21:1 (2014), 70–73
49.
V. O. Mironkin, “Veroyatnost t-kollizii dlya dvukh sluchainykh podstanovok”, Obozrenie prikladnoi i promyshlennoi matematiki, 21:4, (2014), 381–383
2013
50.
V. O. Mironkin, “Metody vosstanovleniya neizvestnogo podmnozhestva pri deistvii sluchainogo otobrazheniya spetsialnogo vida”, Obozrenie prikladnoi i promyshlennoi matematiki, 20:2 (2013), 144–146
51.
V. O. Mironkin, “O metode svyaznogo oprobovaniya elementov neizvestnogo podmnozhestva pri deistvii sluchainogo otobrazheniya spetsialnogo vida”, Obozrenie prikladnoi i promyshlennoi matematiki, 20:4 (2013), 562–564
2012
52.
V. O. Mironkin, “Vosstanovlenie podmnozhestva oblasti opredeleniya pri otobrazhenii spetsialnogo vida”, Obozrenie prikladnoi i promyshlennoi matematiki, 19:3 (2012), 413–414
2024
Contact us: