|
|
|
Publications in Math-Net.Ru |
Citations |
|
2025 |
| 1. |
O. A. Kozlitin, “Stability of remote voting protocols to compromise of network subscribers: an information-theoretical approach”, Mat. Vopr. Kriptogr., 16:3 (2025), 41–59  |
|
2024 |
| 2. |
O. A. Kozlitin, “Remote voting protocols. II”, Mat. Vopr. Kriptogr., 15:3 (2024), 83–100 |
1
|
|
2023 |
| 3. |
O. A. Kozlitin, M. A. Suleymanov, “Remote voting protocols. I”, Mat. Vopr. Kriptogr., 14:4 (2023), 89–110 |
2
|
|
2022 |
| 4. |
O. A. Kozlitin, “Periodical properties of multidimensional polynomial generator over Galois ring. IV”, Mat. Vopr. Kriptogr., 13:4 (2022), 69–95  |
| 5. |
O. A. Kozlitin, “Periodical properties of multidimensional polynomial transformations of Galois – Eisenstein ring”, Mat. Vopr. Kriptogr., 13:1 (2022), 69–99 |
1
|
|
2020 |
| 6. |
O. A. Kozlitin, “Periodical properties of multidimensional polynomial generator over Galois ring. III”, Mat. Vopr. Kriptogr., 11:4 (2020), 49–76 |
2
|
| 7. |
O. A. Kozlitin, “Periodical properties of multidimensional polynomial generator over Galois ring. II”, Mat. Vopr. Kriptogr., 11:1 (2020), 63–100 |
3
|
|
2019 |
| 8. |
O. A. Kozlitin, “Pseudorandom sequence generators based on shift registers over finite chain rings”, Mat. Vopr. Kriptogr., 10:3 (2019), 49–65 |
1
|
|
2018 |
| 9. |
O. A. Kozlitin, “Periodic properties of multidimensional polynomial generator over the Galois ring. I”, Mat. Vopr. Kriptogr., 9:3 (2018), 61–98  |
5
|
|
2017 |
| 10. |
O. A. Kozlitin, “Estimate of the maximal cycle length in the graph of polynomial transformation of Galois–Eisenstein ring”, Diskr. Mat., 29:4 (2017), 41–58 ; Discrete Math. Appl., 28:6 (2018), 345–358   |
6
|
| 11. |
O. A. Kozlitin, “On periodic properties of polylinear shift registers”, Diskr. Mat., 29:1 (2017), 27–50 ; Discrete Math. Appl., 28:1 (2018), 35–52 |
2
|
| 12. |
O. A. Kozlitin, “Probabilistic linear relations in binary recurring sequences”, Mat. Vopr. Kriptogr., 8:3 (2017), 57–84 |
|
2015 |
| 13. |
D. M. Ermilov, O. A. Kozlitin, “On the structure of graph of polynomial transformation of the Galois ring”, Mat. Vopr. Kriptogr., 6:3 (2015), 47–73 |
8
|
|
2014 |
| 14. |
O. A. Kozlitin, “Constructing pseudorandom sequences by means of $2$-linear shift register”, Mat. Vopr. Kriptogr., 5:1 (2014), 39–72 |
3
|
|
2013 |
| 15. |
D. M. Ermilov, O. A. Kozlitin, “Cyclic structure of a polynomial generator over the Galois ring”, Mat. Vopr. Kriptogr., 4:1 (2013), 27–57 |
15
|
|
2012 |
| 16. |
O. A. Kozlitin, “$2$-linear shift register over the Galois ring of even characteristic”, Mat. Vopr. Kriptogr., 3:2 (2012), 27–61 |
5
|
|
2011 |
| 17. |
O. A. Kozlitin, “Parallel decomposition of nonautonomous 2-linear shift registers”, Mat. Vopr. Kriptogr., 2:3 (2011), 5–29 |
2
|
|
2007 |
| 18. |
O. A. Kozlitin, “Properties of the output sequence of a simplest 2-linear shift register over $\mathbf Z_{2^n}$”, Diskr. Mat., 19:4 (2007), 70–96  ; Discrete Math. Appl., 17:6 (2007), 539–566 |
3
|
| 19. |
O. A. Kozlitin, “Periodic properties of a simplest 2-linear shift register”, Diskr. Mat., 19:3 (2007), 51–78 ; Discrete Math. Appl., 17:2 (2007), 135–162 |
4
|
|
2004 |
| 20. |
O. A. Kozlitin, “Polynomial transformations of a GEO-ring of prime characteristic”, Diskr. Mat., 16:3 (2004), 105–117 ; Discrete Math. Appl., 14:4 (2004), 373–384 |
1
|
|
|
|
2026 |
| 21. |
M. A. Goltvanitsa, O. V. Kamlovskii, S. Yu. Katyshev, O. A. Kozlitin, V. V. Mizerov, “On the development of scientific directions proposed by A. A. Nechaev”, Mat. Vopr. Kriptogr., 17:1 (2026), 5–25 |
|
2020 |
| 22. |
G. V. Balakin, S. M. Buravlev, S. P. Gorshkov, A. M. Zubkov, G. I. Ivchenko, A. V. Knyazev, A. P. Kovalenko, O. A. Kozlitin, V. A. Kopyttsev, A. V. Lapshin, D. V. Matyukhin, Yu. I. Medvedev, V. G. Mikhailov, A. V. Mikhalev, Yu. V. Nesterenko, A. B. Pichkur, B. A. Pogorelov, V. N. Sachkov, A. V. Tarasov, I. G. Shaposhnikov, V. A. Shishkin, A. M. Shoitov, “To the memory of Igor Aleksandrovich Kruglov”, Mat. Vopr. Kriptogr., 11:4 (2020), 5–6 |
|
| Organisations |
- LLC "Certification Research Center", Moscow
|
| |
|
|
Contact us: