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

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

The table below contains the list of citations in 2017 to the papers published in 2015–2016. 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.	M. V. Zaets, “Razryadno-polinomialnoe postroenie podstanovok nad koltsom Galua”, PDM. Prilozhenie, 2017, № 10, 17–19	→	Construction of substitutions by means of variationally-coordinate polynomial functions over the primary residue ring M. V. Zaets Mat. Vopr. Kriptogr., 6:1 (2015),  5–32
2.	A. V. Tarasov, “Stabilizatory nekotorykh semeistv bulevykh funktsii ot $n$ peremennykh, obrazuyuschikh Galua-zamknutye podalgebry algebry Shefera. II”, Matem. vopr. kriptogr., 8:4 (2017), 135–156	→	Schaefer classes, Post classes and Galois connections V. S. Litvinenko, A. V. Tarasov Mat. Vopr. Kriptogr., 6:1 (2015),  81–107
3.	F. M. Malyshev, “Kriptograficheski slabye funktsii uslozhneniya dlya trekhchlennykh lineinykh rekurrentnykh posledovatelnostei”, Matem. vopr. kriptogr., 8:1 (2017), 69–80	→	The complexity of initial state recovery for a class of filter generators F. M. Malyshev Mat. Vopr. Kriptogr., 6:1 (2015),  109–116
4.	S. V. Polin, “Perestanovochnye reshetki otnoshenii ekvivalentnosti na dekartovykh proizvedeniyakh i soglasovannye s nimi sistemy uravnenii. II”, Matem. vopr. kriptogr., 8:3 (2017), 85–108	→	Permutation lattices of equivalence relations on the Cartesian products and systems of equations concordant with these lattices. I S. V. Polin Mat. Vopr. Kriptogr., 6:1 (2015),  135–158
5.	A. V. Menyachikhin, “Spectral-linear and spectral-differential methods for generating S-boxes having almost optimal cryptographic parameters”, Matem. vopr. kriptogr., 8:2 (2017), 97–116	→	Combinatorial properties of differentially $2$-uniform substitutions V. N. Sachkov Mat. Vopr. Kriptogr., 6:1 (2015),  159–179
6.	V. N. Sachkov, “Involyutsii s dannym vesovym defitsitom, sootvetstvuyuschie tablitse Keli konechnoi abelevoi gruppy”, Matem. vopr. kriptogr., 8:4 (2017), 117–134	→	Combinatorial properties of differentially $2$-uniform substitutions V. N. Sachkov Mat. Vopr. Kriptogr., 6:1 (2015),  159–179
7.	Nguyen Bui Cuong, Nguyen Van Long, Hoang Dinh Linh, “Analyzing the influence of linear redundancy in S-boxes on the affine equivalence within XSL-like round functions”, Matem. vopr. kriptogr., 8:1 (2017), 51–68	→	On a new Russian Encryption Standard D. M. Dygin, I. V. Lavrikov, G. B. Marshalko, V. I. Rudskoy, D. I. Trifonov, V. A. Shishkin Mat. Vopr. Kriptogr., 6:2 (2015),  29–34
8.	D. A. Burov, B. A. Pogorelov, “The influence of linear mapping reducibility on the choice of round constants”, Matem. vopr. kriptogr., 8:2 (2017), 51–64	→	On a new Russian Encryption Standard D. M. Dygin, I. V. Lavrikov, G. B. Marshalko, V. I. Rudskoy, D. I. Trifonov, V. A. Shishkin Mat. Vopr. Kriptogr., 6:2 (2015),  29–34
9.	A. V. Menyachikhin, “Spectral-linear and spectral-differential methods for generating S-boxes having almost optimal cryptographic parameters”, Matem. vopr. kriptogr., 8:2 (2017), 97–116	→	On a new Russian Encryption Standard D. M. Dygin, I. V. Lavrikov, G. B. Marshalko, V. I. Rudskoy, D. I. Trifonov, V. A. Shishkin Mat. Vopr. Kriptogr., 6:2 (2015),  29–34
10.	D. V. Pilschikov, “Asimptoticheskoe povedenie moschnosti polnogo proobraza obraza sluchainogo mnozhestva pri iteratsiyakh otobrazhenii konechnogo mnozhestva”, Matem. vopr. kriptogr., 8:1 (2017), 95–106	→	On the limiting mean values in probabilistic models of time-memory-data tradeoff methods D. V. Pilshchikov Mat. Vopr. Kriptogr., 6:2 (2015),  59–65
11.	A. M. Zubkov, V. O. Mironkin, “Raspredelenie dliny otrezka aperiodichnosti v grafe $k$-kratnoi iteratsii sluchainogo ravnoveroyatnogo otobrazheniya”, Matem. vopr. kriptogr., 8:4 (2017), 63–74	→	On the limiting mean values in probabilistic models of time-memory-data tradeoff methods D. V. Pilshchikov Mat. Vopr. Kriptogr., 6:2 (2015),  59–65
12.	O. A. Kozlitin, “Otsenka dliny maksimalnogo tsikla v grafe polinomialnogo preobrazovaniya koltsa Galua–Eizenshteina”, Diskret. matem., 29:4 (2017), 41–58	→	On the structure of graph of polynomial transformation of the Galois ring D. M. Ermilov, O. A. Kozlitin Mat. Vopr. Kriptogr., 6:3 (2015),  47–73
13.	A. Yu. Nesterenko, “A new authenticated encryption mode for arbitrary block cipher based on universal hash function”, Matem. vopr. kriptogr., 8:2 (2017), 117–130	→	On a family of universal hash functions A. Yu. Nesterenko Mat. Vopr. Kriptogr., 6:3 (2015),  135–151
14.	A. V. Tarasov, “Stabilizatory nekotorykh semeistv bulevykh funktsii ot $n$ peremennykh, obrazuyuschikh Galua-zamknutye podalgebry algebry Shefera. II”, Matem. vopr. kriptogr., 8:4 (2017), 135–156	→	Stabilizers of some families of Boolean functions constituting Galois-closed subalgebras of the Schaefer algebra A. V. Tarasov Mat. Vopr. Kriptogr., 6:4 (2015),  99–125
15.	I. M. Arbekov, “Lower bounds for the practical secrecy of a key”, Matem. vopr. kriptogr., 8:2 (2017), 29–38	→	Criteria of key security I. M. Arbekov Mat. Vopr. Kriptogr., 7:1 (2016),  39–56
16.	I. M. Arbekov, S. N. Molotkov, “Distinguishability of quantum states and shannon complexity in quantum cryptography”, J. Exp. Theor. Phys., 125:1 (2017), 50–64	→	Criteria of key security I. M. Arbekov Mat. Vopr. Kriptogr., 7:1 (2016),  39–56
17.	A. N. Klimov, S. P. Kulik, S. N. Molotkov, T. A. Potapova, “On a simple attack, limiting the range transmission of secret keys in a system of quantum cryptography based on coding in a sub-carrier frequency”, Laser Phys. Lett., 14:3 (2017), 035201	→	Criteria of key security I. M. Arbekov Mat. Vopr. Kriptogr., 7:1 (2016),  39–56
18.	M. A. Borodin, A. S. Rybkin, A. V. Urivskiy, “On conditional probabilities of output sequences for permutation-based prngs”, 2017 Fourth International Conference on Engineering and Telecommunication (En&T), eds. E. Pavlyukova, L. Uzhinskaya, Z. Suroegina, IEEE, 2017, 18–22	→	Criteria of key security I. M. Arbekov Mat. Vopr. Kriptogr., 7:1 (2016),  39–56
19.	D. A. Burov, B. A. Pogorelov, “The influence of linear mapping reducibility on the choice of round constants”, Matem. vopr. kriptogr., 8:2 (2017), 51–64	→	An attack on $\mathrm{6}$ rounds of Khazad D. A. Burov, B. A. Pogorelov Mat. Vopr. Kriptogr., 7:2 (2016),  35–46
20.	A. V. Volgin, G. V. Kryuchkov, “Kharakterizatsiya lineinykh preobrazovanii, zadayuschixsya matritsami Adamara nad konechnym polem i tsirkulyantnymi matritsami”, PDM. Prilozhenie, 2017, № 10, 10–11	→	An attack on $\mathrm{6}$ rounds of Khazad D. A. Burov, B. A. Pogorelov Mat. Vopr. Kriptogr., 7:2 (2016),  35–46
1 2  Full list