|
2-years impact-factor Math-Net.Ru of «Prikladnaya Diskretnaya Matematika» journal, 2020
2-years impact-factor Math-Net.Ru of the journal in 2020 is calculated
as the number of citations in 2020 to the scientific papers published during
2018–2019.
The table below contains the list of citations in 2020 to the papers
published in 2018–2019. 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.
| Year |
2-years impact-factor Math-Net.Ru |
Scientific papers |
Citations |
Citated papers |
Journal Self-citations |
| 2020 |
0.488 |
80 |
39 |
26 |
28.2% |
|
|
|
| N |
Citing pulication |
|
Cited paper |
|
| 1. |
S. V. Agievich, “The Counter mode with encrypted nonces and its extension to authenticated encryption”, Matem. vopr. kriptogr., 11:2 (2020), 7–24  |
→ |
EHE: nonce misuse-resistant message authentication S. V. Agievich Prikl. Diskr. Mat., 2018, no. 39, 33–41
|
|
| 2. |
M. A. Poltavtseva, M. O. Kalinin, “Conceptual data modeling using aggregates to ensure large-scale distributed data management systems security”, Intelligent Distributed Computing Xiii, Studies in Computational Intelligence, 868, eds. I. Kotenko, C. Badica, V. Desnitsky, D. ElBaz, M. Ivanovic, Springer, 2020, 41–47  |
→ |
Multilevel thematic-hierarchical access control (MLTHS-system) N. A. Gaydamakin Prikl. Diskr. Mat., 2018, no. 39, 42–57
|
|
| 3. |
A. V. Seliverstov, “Simmetrichnye matritsy, elementami kotorykh sluzhat lineinye funktsii”, Zh. vychisl. matem. i matem. fiz., 60:1 (2020), 109–115  |
→ |
On complexity of the satisfiability problem of systems over finite posets A. Y. Nikitin, A. N. Rybalov Prikl. Diskr. Mat., 2018, no. 39, 94–98
|
|
| 4. |
I. V. Borovkova, V. A. Kondratev, I. A. Pankratova, “Kriptoanaliz asimmetrichnogo shifra na bulevykh funktsiyakh”, PDM, 2020, № 50, 42–50  |
→ |
Asymmetric cryptosystems on Boolean functions G. P. Agibalov, I. A. Pankratova Prikl. Diskr. Mat., 2018, no. 40, 23–33
|
|
| 5. |
A. Gorodilova, S. Agievich, C. Carlet, X.-d. Hou, V. Idrisova, N. Kolomeec, A. Kutsenko, L. Mariot, A. Oblaukhov, S. Picek, B. Preneel, R. Rosie, N. Tokareva, “The fifth international students? Olympiad in cryptography?nsucrypto: problems and their solutions”, Cryptologia, 44:3 (2020), 223–256  |
→ |
Mathematical methods in solutions of the problems presented at the Third International Students' Olympiad in Cryptography N. Tokareva, A. Gorodilova, S. Agievich, V. Idrisova, N. Kolomeec, A. Kutsenko, A. Oblaukhov, G. Shushuev Prikl. Diskr. Mat., 2018, no. 40, 34–58
|
| 6. |
A. K. Oblaukhov, “On metric complements and metric regularity in finite metric spaces”, PDM, 2020, № 49, 35–45  |
→ |
Mathematical methods in solutions of the problems presented at the Third International Students' Olympiad in Cryptography N. Tokareva, A. Gorodilova, S. Agievich, V. Idrisova, N. Kolomeec, A. Kutsenko, A. Oblaukhov, G. Shushuev Prikl. Diskr. Mat., 2018, no. 40, 34–58
|
| 7. |
D. A. Zyubina, N. N. Tokareva, “Cryptographic properties of a simple S-box construction based on a Boolean function and a permutation”, PDM. Prilozhenie, 2020, № 13, 41–43  |
→ |
Mathematical methods in solutions of the problems presented at the Third International Students' Olympiad in Cryptography N. Tokareva, A. Gorodilova, S. Agievich, V. Idrisova, N. Kolomeec, A. Kutsenko, A. Oblaukhov, G. Shushuev Prikl. Diskr. Mat., 2018, no. 40, 34–58
|
|
| 8. |
A. A. Perov, A. I. Pestunov, “O vozmozhnosti primeneniya svertochnykh neironnykh setei k postroeniyu universalnykh atak na iterativnye blochnye shifry”, PDM, 2020, № 49, 46–56  |
→ |
Efficient steganography detection by means of compression-based integral classifier V. A. Monarev, A. I. Pestunov Prikl. Diskr. Mat., 2018, no. 40, 59–71
|
| 9. |
E.A. Basinya, D.S. Khudiakov, 2020 International Multi-Conference on Industrial Engineering and Modern Technologies (FarEastCon), 2020, 1  |
→ |
Efficient steganography detection by means of compression-based integral classifier V. A. Monarev, A. I. Pestunov Prikl. Diskr. Mat., 2018, no. 40, 59–71
|
|
| 10. |
Sh. B. Shikhiev, F. Sh. Shikhiev, “Inkapsulyatsiya semanticheskikh predstavlenii v elementy grammatiki”, Inform. i ee primen., 14:1 (2020), 121–127  |
→ |
Formal grammar of Russian language in examples Ya. M. Mirzabekov, Sh. B. Shihiev Prikl. Diskr. Mat., 2018, no. 40, 114–126
|
|
| 11. |
O. V. Denisov, “Ataki razlicheniya na blochnye shifrsistemy po raznostyam dvublochnykh tekstov”, PDM, 2020, № 48, 43–62  |
→ |
Criteria for Markov block ciphers O. V. Denisov Prikl. Diskr. Mat., 2018, no. 41, 28–37
|
| 12. |
A. A. Perov, A. I. Pestunov, “O vozmozhnosti primeneniya svertochnykh neironnykh setei k postroeniyu universalnykh atak na iterativnye blochnye shifry”, PDM, 2020, № 49, 46–56  |
→ |
Criteria for Markov block ciphers O. V. Denisov Prikl. Diskr. Mat., 2018, no. 41, 28–37
|
|
| 13. |
V. O. Mironkin, “Sloi v grafe kompozitsii nezavisimykh ravnoveroyatnykh sluchainykh otobrazhenii”, Matem. vopr. kriptogr., 11:1 (2020), 101–114  |
→ |
On estimations of distribution of the length of aperiodicity segment in the graph of $k$-fold iteration of uniform random mapping V. O. Mironkin Prikl. Diskr. Mat., 2018, no. 42, 6–17
|
|
| 14. |
I. V. Cherednik, “Ob ispolzovanii binarnykh operatsii pri postroenii kratno tranzitivnogo mnozhestva blochnykh preobrazovanii”, Diskret. matem., 32:2 (2020), 85–111  |
→ |
One approach to constructing a multiply transitive class of block transformations I. V. Cherednik Prikl. Diskr. Mat., 2018, no. 42, 18–47
|
| 15. |
I. V. Cherednik, “Ob odnom podkhode k postroeniyu kratno tranzitivnogo mnozhestva blochnykh preobrazovanii”, PDM. Prilozhenie, 2020, № 13, 69–71  |
→ |
One approach to constructing a multiply transitive class of block transformations I. V. Cherednik Prikl. Diskr. Mat., 2018, no. 42, 18–47
|
|
| 16. |
A.Yu. Bykov, I.A. Krygin, M.V. Grishunin, I.A. Markova, “On one Saddle Point Search Algorithm for Continuous Linear Games as Applied to Information Security Problems”, HoBMSTU.SIE, 2020, no. 4 (133), 58  |
→ |
Deterministic methods of Ramanujan graph construction for use in cryptographic algorithms based on generalized cellular automata P. G. Klyucharev Prikl. Diskr. Mat., 2018, no. 42, 76–93
|
|
| 17. |
A. A. Kuznetsov, A. S. Kuznetsova, V. V. Kishkan, “The Cayley Graphs of a Centralizer of the Burnside Group B-0(2,5)”, Reshetnev Readings 2018, IOP Conference Series-Materials Science and Engineering, 822, IOP Publishing Ltd, 2020, 012043  |
→ |
A resource-efficient algorithm for study the growth in finite two-generator groups of exponent $5$ A. A. Kuznetsov, A. S. Kuznetsova Prikl. Diskr. Mat., 2018, no. 42, 94–103
|
|
| 18. |
M. S. Bespalov, “Troichnyi diskretnyi veivletnyi bazis”, Izv. Sarat. un-ta. Nov. ser. Ser.: Matematika. Mekhanika. Informatika, 20:3 (2020), 367–377  |
→ |
Bernoulli's discrete periodic functions M. S. Bespalov Prikl. Diskr. Mat., 2019, no. 43, 16–36
|
|
| 19. |
N. Kausar, M. Munir, M. Gulzar, G. M. Addis, R. Anjum, “Anti fuzzy bi-ideals on ordered ag-groupoids”, J. Indones. Math. Soc., 26:3 (2020), 299–318  |
→ |
Characterizations of non associative ordered semigroups by the properties of their fuzzy ideals with thresholds $(\alpha,\beta]$ K. Nasreen Prikl. Diskr. Mat., 2019, no. 43, 37–59
|
| 20. |
N. Kausar, M. Munir, M. Gulzar, M. Alesemi, Salahuddin, “Ordered la-groups and ideals in ordered la-semigroups”, Ital. J. Pure Appl. Math., 2020, no. 44, 723–730  |
→ |
Characterizations of non associative ordered semigroups by the properties of their fuzzy ideals with thresholds $(\alpha,\beta]$ K. Nasreen Prikl. Diskr. Mat., 2019, no. 43, 37–59
|
|
|
|
| Total publications: |
910 |
| Scientific articles: |
890 |
| Authors: |
621 |
| Citations: |
1685 |
| Cited articles: |
486 |
 |
Impact Factor Web of Science |
|
for 2025:
0.100 |
|
for 2024:
0.100 |
|
for 2023:
0.200 |
 |
Scopus Metrics |
|
2025 |
CiteScore |
0.400 |
|
2025 |
SNIP |
0.457 |
|
2025 |
SJR |
0.200 |
|
2024 |
CiteScore |
0.400 |
|
2024 |
SNIP |
0.266 |
|
2024 |
SJR |
0.135 |
|
2023 |
CiteScore |
0.600 |
|
2023 |
SNIP |
0.569 |
|
2023 |
SJR |
0.230 |
|
2022 |
SJR |
0.221 |
|
2021 |
SJR |
0.214 |
|
2020 |
SJR |
0.222 |
|
2019 |
SJR |
0.157 |
|
2018 |
CiteScore |
0.330 |
|
2018 |
SJR |
0.265 |
|
2017 |
CiteScore |
0.210 |
|
2017 |
SNIP |
0.072 |
|
2017 |
SJR |
0.200 |
|