|
|
Publications in Math-Net.Ru
-
Problems in theory of cryptanalytical invertibility of finite automata
Prikl. Diskr. Mat., 2020, no. 50, 62–71
-
Cryptanalytical finite automaton invertibility with finite delay
Prikl. Diskr. Mat., 2019, no. 46, 27–37
-
Cryptanalytic concept of finite automaton invertibility with finite delay
Prikl. Diskr. Mat., 2019, no. 44, 34–42
-
Cryptanalytic invertibility with finite delay of finite automata
Prikl. Diskr. Mat. Suppl., 2019, no. 12, 84–86
-
ElGamal cryptosystems on Boolean functions
Prikl. Diskr. Mat., 2018, no. 42, 57–65
-
Asymmetric cryptosystems on Boolean functions
Prikl. Diskr. Mat., 2018, no. 40, 23–33
-
Public key cryptosystems on Boolean functions
Prikl. Diskr. Mat. Suppl., 2018, no. 11, 54–57
-
Substitution block ciphers with functional keys
Prikl. Diskr. Mat., 2017, no. 38, 57–65
-
Cryptautomata with functional keys
Prikl. Diskr. Mat., 2017, no. 36, 59–72
-
About $2$-cascade finite automata cryptographic generators and their cryptanalysis
Prikl. Diskr. Mat., 2017, no. 35, 38–47
-
Cryptautomata: definition, cryptanalysis, example
Prikl. Diskr. Mat. Suppl., 2017, no. 10, 106–110
-
Watermarking ciphers
Prikl. Diskr. Mat., 2016, no. 1(31), 62–66
-
To cryptanalysis of $2$-cascade finite automata cryptographic generators
Prikl. Diskr. Mat. Suppl., 2016, no. 9, 41–43
-
Watermarking ciphers
Prikl. Diskr. Mat. Suppl., 2015, no. 8, 54–59
-
SIBCiphers – symmetric iterative block ciphers composed of Boolean functions depending on small number of variables
Prikl. Diskr. Mat. Suppl., 2014, no. 7, 43–48
-
Cryptographic extension and its implementation for Russian programming language
Prikl. Diskr. Mat., 2013, no. 3(21), 93–104
-
Project of hardware implementation of Russian programming language
Prikl. Diskr. Mat. Suppl., 2013, no. 6, 98–102
-
Cryptographic extension of Russian programming language
Prikl. Diskr. Mat. Suppl., 2013, no. 6, 93–98
-
Sibecrypt'12 review
Prikl. Diskr. Mat., 2012, no. 4(18), 108–122
-
To reanimation of Russian programming language
Prikl. Diskr. Mat., 2012, no. 3(17), 77–84
-
Sibecrypt'10 review
Prikl. Diskr. Mat., 2010, no. 4(10), 109–124
-
Statistical approximation theory for discrete functions with application in cryptanalysis of iterative block ciphers
Prikl. Diskr. Mat., 2010, no. 3(9), 51–68
-
Finite automata in cryptography
Prikl. Diskr. Mat., 2009, no. supplement № 2, 43–73
-
50 years of cryptography in Tomsk State University
Prikl. Diskr. Mat., 2009, no. 2(4), 104–126
-
Discrete automata on semilattices
Prikl. Diskr. Mat., 2009, no. 2(4), 26–49
-
Some theoretical aspects of differential cryptanalysis of the iterated block ciphers with additive round key
Prikl. Diskr. Mat., 2008, no. 1(1), 34–42
-
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
-
On the coding of semilattices and automata on semilattices
Diskr. Mat., 3:1 (1991), 74–87
-
A mathematical model of circuits of elements with controllable conductivity
Avtomat. i Telemekh., 1982, no. 9, 89–98
-
Description of Cascade Networks of Finite Automata In Terms of Codings and Coverings
Probl. Peredachi Inf., 18:3 (1982), 74–84
-
In memory of Valentina Vladimirovna Bykova
Prikl. Diskr. Mat., 2019, no. 45, 5
-
In memory of Mikhail Mikhailovich Glukhov
Prikl. Diskr. Mat., 2018, no. 42, 5
-
To teacher's memory
Prikl. Diskr. Mat., 2014, no. 1(23), 5–8
-
SIBECRYPT'11 review
Prikl. Diskr. Mat., 2011, no. 4(14), 105–120
-
Foreword
Prikl. Diskr. Mat., 2009, no. 2(4), 5–8
-
About the journal
Prikl. Diskr. Mat., 2008, no. 1(1), 5–6
© , 2024