2-years impact-factor Math-Net.Ru of «Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]» journal, 2019

2-years impact-factor Math-Net.Ru of the journal in 2019 is calculated as the number of citations in 2019 to the scientific papers published during 2017–2018.

The table below contains the list of citations in 2019 to the papers published in 2017–2018. We take into account all citing publications we found from different sources, mostly from references lists available on Math-Net.Ru. Both original and translation versions are taken into account.

The impact factor Math-Net.Ru may change when new citations to a year given are found.

1 2  Full list
N	Citing pulication		Cited paper
1.	Yu. V. Kosolapov, “Sposob vkrapleniya dannykh na osnove odnoi skhemy razdeleniya sekreta”, Sistemy i sredstva inform., 29:3 (2019), 180–193	→	Blakley type secret sharing scheme based on the intersection of subspaces Yu. V. Kosolapov Mat. Vopr. Kriptogr., 8:1 (2017),  13–30
2.	V. O. Mironkin, “Sloi v grafe $k$-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Matem. vopr. kriptogr., 10:1 (2019), 73–82	→	Asymptotic behaviour of the complete preimage cardinality for the image of a random set under iterations of mappings of a finite set D. V. Pilshchikov Mat. Vopr. Kriptogr., 8:1 (2017),  95–106
3.	D. V. Pilschikov, “Ob odnom teoretiko-veroyatnostnom podkhode k obosnovaniyu nadezhnosti metoda Khellmana”, Matem. vopr. kriptogr., 10:1 (2019), 83–114	→	Asymptotic behaviour of the complete preimage cardinality for the image of a random set under iterations of mappings of a finite set D. V. Pilshchikov Mat. Vopr. Kriptogr., 8:1 (2017),  95–106
4.	V. O. Mironkin, “Raspredelenie dliny otrezka aperiodichnosti v grafe kompozitsii nezavisimykh ravnoveroyatnykh sluchainykh otobrazhenii”, Matem. vopr. kriptogr., 10:3 (2019), 89–99	→	Asymptotic behaviour of the complete preimage cardinality for the image of a random set under iterations of mappings of a finite set D. V. Pilshchikov Mat. Vopr. Kriptogr., 8:1 (2017),  95–106
5.	V. O. Mironkin, “Kollizii i intsidentnost vershin komponentam v grafe $k$-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Diskret. matem., 31:4 (2019), 38–52	→	Asymptotic behaviour of the complete preimage cardinality for the image of a random set under iterations of mappings of a finite set D. V. Pilshchikov Mat. Vopr. Kriptogr., 8:1 (2017),  95–106
6.	B. A. Pogorelov, M. A. Pudovkina, “Kharakterizatsiya otobrazhenii cherez svoistvo neizometrichnosti”, Matem. vopr. kriptogr., 10:4 (2019), 77–116	→	Partitions on bigrams and Markov property of block ciphers B. A. Pogorelov, M. A. Pudovkina Mat. Vopr. Kriptogr., 8:1 (2017),  107–142
7.	B. A. Pogorelov, M. A. Pudovkina, “$\otimes_{\mathbf{W}}$-markovost XSL-algoritmov blochnogo shifrovaniya, svyazannaya so svoistvami sloev raundovoi funktsii”, Matem. vopr. kriptogr., 10:1 (2019), 115–142	→	Partitions on bigrams and Markov property of block ciphers B. A. Pogorelov, M. A. Pudovkina Mat. Vopr. Kriptogr., 8:1 (2017),  107–142
8.	S. V. Agievich, A. S. Maslov, Yu. S. Yaroshenya, “O veroyatnostyakh raznostnykh traektorii sponge-funktsii Bash-f”, PDM. Prilozhenie, 2019, № 12, 86–90	→	Bash-f: another LRX sponge function S. V. Agievich, V. V. Marchuk, A. S. Maslau, V. I. Semenov Mat. Vopr. Kriptogr., 8:2 (2017),  7–28
9.	V. O. Mironkin, “Sloi v grafe $k$-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Matem. vopr. kriptogr., 10:1 (2019), 73–82	→	On the properties of the CTR encryption mode of Magma and Kuznyechik block ciphers with re-keying method based on CryptoPro Key Meshing L. R. Ahmetzyanova, E. K. Alekseev, I. B. Oshkin, S. V. Smyshlyaev, L. A. Sonina Mat. Vopr. Kriptogr., 8:2 (2017),  39–50
10.	L. R. Ahmetzyanova, E. K. Alekseev, G. K. Sedov, E. S. Smyshlyaeva, S. V. Smyshlyaev, “Practical significance of security bounds for standardized internally re-keyed block cipher modes”, Matem. vopr. kriptogr., 10:2 (2019), 31–46	→	On the properties of the CTR encryption mode of Magma and Kuznyechik block ciphers with re-keying method based on CryptoPro Key Meshing L. R. Ahmetzyanova, E. K. Alekseev, I. B. Oshkin, S. V. Smyshlyaev, L. A. Sonina Mat. Vopr. Kriptogr., 8:2 (2017),  39–50
11.	V. O. Mironkin, “Raspredelenie dliny otrezka aperiodichnosti v grafe kompozitsii nezavisimykh ravnoveroyatnykh sluchainykh otobrazhenii”, Matem. vopr. kriptogr., 10:3 (2019), 89–99	→	On the properties of the CTR encryption mode of Magma and Kuznyechik block ciphers with re-keying method based on CryptoPro Key Meshing L. R. Ahmetzyanova, E. K. Alekseev, I. B. Oshkin, S. V. Smyshlyaev, L. A. Sonina Mat. Vopr. Kriptogr., 8:2 (2017),  39–50
12.	D. A. Burov, “Podgruppy pryamogo proizvedeniya grupp, invariantnye otnositelno deistviya podstanovok na somnozhitelyakh”, Diskret. matem., 31:4 (2019), 3–19	→	The influence of linear mapping reducibility on the choice of round constants D. A. Burov, B. A. Pogorelov Mat. Vopr. Kriptogr., 8:2 (2017),  51–64
13.	O. Koi Puente, R. A. De La Krus Khimenes, “Nekotorye sposoby postroeniya MDS-matrits nad konechnym polem”, PDM, 2019, № 46, 5–18	→	The influence of linear mapping reducibility on the choice of round constants D. A. Burov, B. A. Pogorelov Mat. Vopr. Kriptogr., 8:2 (2017),  51–64
14.	M. A. Goltvanitsa, “Metody postroeniya skruchennykh lineinykh rekurrentnykh posledovatelnostei maksimalnogo perioda, baziruyuschiesya na faktorizatsii mnogochlenov Galua v koltse matrichnykh mnogochlenov”, Matem. vopr. kriptogr., 10:4 (2019), 25–51	→	Non-commutative Hamilton–Cayley theorem and roots of characteristic polynomials of skew maximal period linear recurrences over Galois rings M. A. Goltvanitsa Mat. Vopr. Kriptogr., 8:2 (2017),  65–76
15.	A. V. Menyachikhin, “Metod ogranichennogo defitsita i zadacha postroeniya ortomorfizmov i pochti ortomorfizmov abelevykh grupp”, Diskret. matem., 31:3 (2019), 58–77	→	Spectral-linear and spectral-differential methods for generating S-boxes having almost optimal cryptographic parameters A. V. Menyachikhin Mat. Vopr. Kriptogr., 8:2 (2017),  97–116
16.	A. Yu. Zubov, “Kriptosistema shifrovaniya s autentifikatsiei na osnove koda autentifikatsii s sekretnostyu”, PDM, 2019, № 43, 60–69	→	Authentication codes with secrecy (survey) A. Yu. Zubov Mat. Vopr. Kriptogr., 8:3 (2017),  5–40
17.	M. I. Rozhkov, S. S. Malakhov, “Eksperimentalnye metody postroeniya MDS matrits spetsialnogo vida”, Diskretn. analiz i issled. oper., 26:2 (2019), 115–128	→	Complete description of a class of MDS-matrices over finite field of characteristic 2 A. V. Anashkin Mat. Vopr. Kriptogr., 8:4 (2017),  5–28
18.	V. O. Mironkin, “Sloi v grafe $k$-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Matem. vopr. kriptogr., 10:1 (2019), 73–82	→	Distribution of the length of aperiodicity segment in the graph of $k$-fold iteration of uniform random mapping A. M. Zubkov, V. O. Mironkin Mat. Vopr. Kriptogr., 8:4 (2017),  63–74
19.	V. O. Mironkin, “Kollizii i intsidentnost vershin komponentam v grafe $k$-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Diskret. matem., 31:4 (2019), 38–52	→	Distribution of the length of aperiodicity segment in the graph of $k$-fold iteration of uniform random mapping A. M. Zubkov, V. O. Mironkin Mat. Vopr. Kriptogr., 8:4 (2017),  63–74
20.	V. O. Mironkin, “Raspredelenie dliny otrezka aperiodichnosti v grafe kompozitsii nezavisimykh ravnoveroyatnykh sluchainykh otobrazhenii”, Matem. vopr. kriptogr., 10:3 (2019), 89–99	→	Distribution of the length of aperiodicity segment in the graph of $k$-fold iteration of uniform random mapping A. M. Zubkov, V. O. Mironkin Mat. Vopr. Kriptogr., 8:4 (2017),  63–74
1 2  Full list