|
|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
| 1. |
G. P. Agibalov, “Problems in theory of cryptanalytical invertibility of finite automata”, Prikl. Diskr. Mat., 2020, no. 50, 62–71 |
3
|
|
2019 |
| 2. |
G. P. Agibalov, “Cryptanalytical finite automaton invertibility with finite delay”, Prikl. Diskr. Mat., 2019, no. 46, 27–37 |
4
|
| 3. |
G. P. Agibalov, “Cryptanalytic concept of finite automaton invertibility with finite delay”, Prikl. Diskr. Mat., 2019, no. 44, 34–42 |
5
|
| 4. |
G. P. Agibalov, “Cryptanalytic invertibility with finite delay of finite automata”, Prikl. Diskr. Mat. Suppl., 2019, no. 12, 84–86 |
1
|
|
2018 |
| 5. |
G. P. Agibalov, “ElGamal cryptosystems on Boolean functions”, Prikl. Diskr. Mat., 2018, no. 42, 57–65 |
5
|
| 6. |
G. P. Agibalov, I. A. Pankratova, “Asymmetric cryptosystems on Boolean functions”, Prikl. Diskr. Mat., 2018, no. 40, 23–33 |
12
|
| 7. |
G. P. Agibalov, I. A. Pankratova, “Public key cryptosystems on Boolean functions”, Prikl. Diskr. Mat. Suppl., 2018, no. 11, 54–57 |
3
|
|
2017 |
| 8. |
G. P. Agibalov, “Substitution block ciphers with functional keys”, Prikl. Diskr. Mat., 2017, no. 38, 57–65 |
13
|
| 9. |
G. P. Agibalov, “Cryptautomata with functional keys”, Prikl. Diskr. Mat., 2017, no. 36, 59–72 |
7
|
| 10. |
G. P. Agibalov, I. A. Pankratova, “About $2$-cascade finite automata cryptographic generators and their cryptanalysis”, Prikl. Diskr. Mat., 2017, no. 35, 38–47 |
6
|
| 11. |
G. P. Agibalov, “Cryptautomata: definition, cryptanalysis, example”, Prikl. Diskr. Mat. Suppl., 2017, no. 10, 106–110 |
|
2016 |
| 12. |
G. P. Agibalov, “Watermarking ciphers”, Prikl. Diskr. Mat., 2016, no. 1(31), 62–66 |
1
|
| 13. |
G. P. Agibalov, I. A. Pankratova, “To cryptanalysis of $2$-cascade finite automata cryptographic generators”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 41–43 |
3
|
|
2015 |
| 14. |
G. P. Agibalov, “Watermarking ciphers”, Prikl. Diskr. Mat. Suppl., 2015, no. 8, 54–59 |
1
|
|
2014 |
| 15. |
G. P. Agibalov, “SIBCiphers – symmetric iterative block ciphers composed of Boolean functions depending on small number of variables”, Prikl. Diskr. Mat. Suppl., 2014, no. 7, 43–48 |
4
|
|
2013 |
| 16. |
G. P. Agibalov, V. B. Lipsky, I. A. Pankratova, “Cryptographic extension and its implementation for Russian programming language”, Prikl. Diskr. Mat., 2013, no. 3(21), 93–104 |
12
|
| 17. |
G. P. Agibalov, V. B. Lipsky, I. A. Pankratova, “Project of hardware implementation of Russian programming language”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 98–102 |
1
|
| 18. |
G. P. Agibalov, V. B. Lipsky, I. A. Pankratova, “Cryptographic extension of Russian programming language”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 93–98 |
1
|
|
2012 |
| 19. |
G. P. Agibalov, I. A. Pankratova, “Sibecrypt'12 review”, Prikl. Diskr. Mat., 2012, no. 4(18), 108–122 |
| 20. |
G. P. Agibalov, “To reanimation of Russian programming language”, Prikl. Diskr. Mat., 2012, no. 3(17), 77–84 |
2
|
|
2010 |
| 21. |
G. P. Agibalov, “Sibecrypt'10 review”, Prikl. Diskr. Mat., 2010, no. 4(10), 109–124 |
| 22. |
G. P. Agibalov, I. A. Pankratova, “Statistical approximation theory for discrete functions with application in cryptanalysis of iterative block ciphers”, Prikl. Diskr. Mat., 2010, no. 3(9), 51–68 |
4
|
|
2009 |
| 23. |
G. P. Agibalov, “Finite automata in cryptography”, Prikl. Diskr. Mat., 2009, no. supplement № 2, 43–73 |
9
|
| 24. |
G. P. Agibalov, “50 years of cryptography in Tomsk State University”, Prikl. Diskr. Mat., 2009, no. 2(4), 104–126 |
1
|
| 25. |
G. P. Agibalov, “Discrete automata on semilattices”, Prikl. Diskr. Mat., 2009, no. 2(4), 26–49 |
1
|
|
2008 |
| 26. |
G. P. Agibalov, “Some theoretical aspects of differential cryptanalysis of the iterated block ciphers with additive round key”, Prikl. Diskr. Mat., 2008, no. 1(1), 34–42 |
10
|
|
2002 |
| 27. |
G. P. Agibalov, N. G. Parvatov, “On the completeness of systems of monotone functions for the realization of quasi-monotone functions on finite semilattices”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002), 5–22 |
2
|
|
1991 |
| 28. |
G. P. Agibalov, “On the coding of semilattices and automata on semilattices”, Diskr. Mat., 3:1 (1991), 74–87 |
1
|
|
1982 |
| 29. |
G. P. Agibalov, V. A. Buzanov, V. B. Lipskii, B. F. Rumyantsev, “A mathematical model of circuits of elements with controllable conductivity”, Avtomat. i Telemekh., 1982, no. 9, 89–98 ; Autom. Remote Control, 43:9 (1982), 1172–1179 |
1
|
| 30. |
G. P. Agibalov, N. V. Evtushenko, “Description of Cascade Networks of Finite Automata In Terms of Codings and Coverings”, Probl. Peredachi Inf., 18:3 (1982), 74–84 ; Problems Inform. Transmission, 18:3 (1982), 218–226 |
|
|
|
2019 |
| 31. |
G. P. Agibalov, I. A. Pankratova, “In memory of Valentina Vladimirovna Bykova”, Prikl. Diskr. Mat., 2019, no. 45, 5 |
|
2018 |
| 32. |
G. P. Agibalov, I. A. Pankratova, “In memory of Mikhail Mikhailovich Glukhov”, Prikl. Diskr. Mat., 2018, no. 42, 5 |
|
2014 |
| 33. |
G. P. Agibalov, “To teacher's memory”, Prikl. Diskr. Mat., 2014, no. 1(23), 5–8 |
|
2011 |
| 34. |
G. P. Agibalov, “SIBECRYPT'11 review”, Prikl. Diskr. Mat., 2011, no. 4(14), 105–120 |
|
2009 |
| 35. |
G. P. Agibalov, “Foreword”, Prikl. Diskr. Mat., 2009, no. 2(4), 5–8 |
|
2008 |
| 36. |
G. P. Agibalov, “About the journal”, Prikl. Diskr. Mat., 2008, no. 1(1), 5–6 |
|
| Organisations |
|
| |
|
|