F. M. Ablayev, M. F. Ablayev
On the concept of quantum hashing
Mat. Vopr. Kriptogr., 2016, 7:2, 7–20
|
M. F. Ablayev, see F. M. Ablayev
Mat. Vopr. Kriptogr., 2016, 7:2, 7–20
|
A. V. Abornev
Recursively-generated permutations of a binary space
Mat. Vopr. Kriptogr., 2014, 5:2, 7–20
|
A. V. Abornev, see A. A. Nechaev
Mat. Vopr. Kriptogr., 2013, 4:2, 81–100
|
A. V. Abornev
Nonlinear permutations recursively generated over the Galois ring of characteristic 4
Mat. Vopr. Kriptogr., 2014, 5:4, 5–15
|
A. V. Afanasieva, V. B. Balakirskii, S. V. Bezzateev
Private information retrieval protocol
Mat. Vopr. Kriptogr., 2015, 6:4, 5–21
|
S. V. Agievich, S. V. Poruchnik, V. I. Semenov
Small scalar multiplication on Weierstrass curves using division polynomials
Mat. Vopr. Kriptogr., 2022, 13:2, 17–35
|
S. V. Agievich, V. V. Marchuk, A. S. Maslau, V. I. Semenov
Bash-f: another LRX sponge function
Mat. Vopr. Kriptogr., 2017, 8:2, 7–28
|
S. V. Agievich
On the guaranteed number of activations in $\mathsf{XS}$-circuits
Mat. Vopr. Kriptogr., 2021, 12:2, 7–20
|
S. V. Agievich
$\mathsf{XS}$-circuits in block ciphers
Mat. Vopr. Kriptogr., 2019, 10:2, 7–30
|
S. V. Agievich
The Counter mode with encrypted nonces and its extension to authenticated encryption
Mat. Vopr. Kriptogr., 2020, 11:2, 7–24
|
L. R. Ahmetzyanova, E. K. Alekseev, G. A. Karpunin, S. V. Smyshlyaev
On cryptographic properties of the $CVV$ and $PVV$ parameters generation procedures in payment systems
Mat. Vopr. Kriptogr., 2018, 9:2, 23–46
|
L. R. Akhmetzyanova, E. K. Alekseev, A. A. Babueva, S. V. Smyshlyaev
On the (im)possibility of secure ElGamal blind signatures
Mat. Vopr. Kriptogr., 2023, 14:2, 25–42
|
L. R. Ahmetzyanova, E. K. Alekseev, G. K. Sedov, E. S. Smyshlyaeva, S. V. Smyshlyaev
Practical significance of security bounds for standardized internally re-keyed block cipher modes
Mat. Vopr. Kriptogr., 2019, 10:2, 31–46
|
L. R. Ahmetzyanova, E. K. Alekseev, I. B. Oshkin, S. V. Smyshlyaev, L. A. Sonina
On the properties of the CTR encryption mode of Magma and Kuznyechik block ciphers with re-keying method based on CryptoPro Key Meshing
Mat. Vopr. Kriptogr., 2017, 8:2, 39–50
|
L. R. Ahmetzyanova, G. A. Karpunin, G. K. Sedov
Near birthday attack on “$8$ bits” $\mathsf{AEAD}$ mode
Mat. Vopr. Kriptogr., 2019, 10:2, 47–60
|
L. R. Akhmetzyanova, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2024, 15:2, 7–28
|
L. R. Akhmetzyanova, E. K. Alekseev, A. A. Babueva, A. A. Bozhko, S. V. Smyshlyaev
$\mathsf{sMGM}$: parameterizable AEAD mode
Mat. Vopr. Kriptogr., 2023, 14:2, 7–24
|
L. R. Akhmetzyanova, E. K. Alekseev, A. A. Babueva, S. V. Smyshlyaev
On methods of shortening ElGamal-type signatures
Mat. Vopr. Kriptogr., 2021, 12:2, 75–91
|
L. R. Akhmetzyanova, E. K. Alekseev, G. A. Karpunin, V. I. Nozdrunov
On the security of authenticated encryption mode with associated data MGM with respect to confidentiality threat
Mat. Vopr. Kriptogr., 2023, 14:3, 49–73
|
L. R. Akhmetzyanova, E. K. Alekseev, A. A. Babueva, L. O. Nikiforova, S. V. Smyshlyaev
IQRA: Incremental Quadratic Re-keying friendly Authentication scheme
Mat. Vopr. Kriptogr., 2022, 13:3, 5–35
|
L. R. Akhmetzyanova, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2021, 12:3, 5–30
|
L. R. Akhmetzyanova, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2021, 12:4, 5–23
|
L. R. Akhmetzyanova, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2016, 7:4, 7–28
|
A. V. Akishin
On a class of permutation polynomials over rings of residues modulo $2^n$
Mat. Vopr. Kriptogr., 2013, 4:2, 5–15
|
E. K. Alekseev, I. B. Oshkin, V. O. Popov, S. V. Smyshlyaev
On the cryptographic properties of algorithms accompanying the applications of standards GOST R 34.11-2012 and GOST R 34.10-2012
Mat. Vopr. Kriptogr., 2016, 7:1, 5–38
|
E. K. Alekseev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2018, 9:2, 23–46
|
E. K. Alekseev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2023, 14:2, 25–42
|
E. K. Alekseev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2019, 10:2, 31–46
|
E. K. Alekseev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2017, 8:2, 39–50
|
E. K. Alekseev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2023, 14:2, 7–24
|
E. K. Alekseev, L. R. Akhmetzyanova, A. A. Babueva, L. O. Nikiforova, S. V. Smyshlyaev
Two-party GOST signature scheme
Mat. Vopr. Kriptogr., 2024, 15:2, 7–28
|
E. K. Alekseev, E. K. Karelina, O. A. Logachev
On construction of correlation-immune functions via minimal functions
Mat. Vopr. Kriptogr., 2018, 9:2, 7–22
|
E. K. Alekseev, V. O. Popov, A. S. Prokhorov, S. V. Smyshlyaev, L. A. Sonina
On the performance of one perspective LSX-based block cipher
Mat. Vopr. Kriptogr., 2015, 6:2, 7–17
|
E. K. Alekseev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2021, 12:2, 75–91
|
E. K. Alekseev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2023, 14:3, 49–73
|
E. K. Alekseev, V. D. Nikolaev, S. V. Smyshlyaev
On the security properties of Russian standardized elliptic curves
Mat. Vopr. Kriptogr., 2018, 9:3, 5–32
|
E. K. Alekseev, L. R. Ahmetzyanova, A. A. Babueva, S. V. Smyshlyaev
Improving the security of ElGamal-type signatures
Mat. Vopr. Kriptogr., 2021, 12:3, 5–30
|
E. K. Alekseev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2022, 13:3, 5–35
|
E. K. Alekseev, L. R. Ahmetzyanova, A. A. Bozhko, S. V. Smyshlyaev
Secure implementation of digital signature using semi-trusted computational core
Mat. Vopr. Kriptogr., 2021, 12:4, 5–23
|
E. K. Alekseev, L. R. Akhmetzyanova, I. B. Oshkin, S. V. Smyshlyaev
A review of the password authenticated key exchange protocols vulnerabilities and principles of the SESPAKE protocol construction
Mat. Vopr. Kriptogr., 2016, 7:4, 7–28
|
R. AlTawy, O. Duman, A. M. Youssef
Fault analysis of Kuznyechik
Mat. Vopr. Kriptogr., 2016, 7:2, 21–34
|
A. V. Anashkin
Complete description of a class of MDS-matrices over finite field of characteristic 2
Mat. Vopr. Kriptogr., 2017, 8:4, 5–28
|
V. G. Antipkin
Smashing MASH-1
Mat. Vopr. Kriptogr., 2014, 5:2, 21–28
|
V. G. Antipkin, D. O. Pasko
On groups generated by ciphers based on Feistel network
Mat. Vopr. Kriptogr., 2021, 12:2, 39–55
|
I. M. Arbekov
Criteria of key security
Mat. Vopr. Kriptogr., 2016, 7:1, 39–56
|
I. M. Arbekov
Lower bounds for the practical secrecy of a key
Mat. Vopr. Kriptogr., 2017, 8:2, 29–38
|
I. M. Arbekov, S. N. Molotkov
Distribution of secret keys in a quantum network with trusted intermediate nodes
Mat. Vopr. Kriptogr., 2023, 14:3, 9–33
|
M. R. Aref, see S. Karimani
Mat. Vopr. Kriptogr., 2019, 10:2, 97–106
|
P. F. Arrozarena, see A. A. Peñate
Mat. Vopr. Kriptogr., 2022, 13:2, 117–131
|
R. R. Aulet, R. A. de la Cruz Jiménes
Construction of MDS matrices combining the Feistel, Misty and Lai-Massey schemes
Mat. Vopr. Kriptogr., 2021, 12:2, 57–74
|
R. R. Aulet, A. A. Peñate
On properties of some sequences generated by shift registers and Latin squares
Mat. Vopr. Kriptogr., 2023, 14:3, 35–47
|
O. D. Avraamova, D. B. Fomin, V. A. Serov, A. V. Smirnov, V. N. Shokov
A compact bit-sliced representation of Kuznyechik S-box
Mat. Vopr. Kriptogr., 2021, 12:2, 21–38
|
A. A. Babueva, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2023, 14:2, 25–42
|
A. A. Babueva, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2024, 15:2, 7–28
|
A. A. Babueva, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2023, 14:2, 7–24
|
A. A. Babueva, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2021, 12:2, 75–91
|
A. A. Babueva, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2021, 12:3, 5–30
|
A. A. Babueva, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2022, 13:3, 5–35
|
G. V. Balakin
On the solution of some classes of Boolean equations systems of recurrent type
Mat. Vopr. Kriptogr., 2013, 4:1, 5–25
|
G. V. Balakin
On the structure of solutions of nonlinear pseudo-Boolean inequalities systems
Mat. Vopr. Kriptogr., 2012, 3:3, 5–19
|
G. V. Balakin
Linear pseudo-Boolean inequalities
Mat. Vopr. Kriptogr., 2010, 1:3, 5–18
|
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., 2020, 11:4, 5–6
|
G. V. Balakin
On the possibility of partial recovery of some sequences via observations
Mat. Vopr. Kriptogr., 2013, 4:4, 7–25
|
V. B. Balakirskii, see A. V. Afanas'eva
Mat. Vopr. Kriptogr., 2015, 6:4, 5–21
|
A. V. Baryshnikov, S. Yu. Katyshev
Key agreement schemes based on linear groupoids
Mat. Vopr. Kriptogr., 2017, 8:1, 7–12
|
A. V. Baryshnikov, see S. Yu. Katyshev
Mat. Vopr. Kriptogr., 2020, 11:3, 31–39
|
A. V. Baryshnikov, S. Yu. Katyshev
Application of non-associative structures to the construction of public key distribution algorithms
Mat. Vopr. Kriptogr., 2018, 9:4, 5–30
|
S. V. Bezzateev, see A. V. Afanas'eva
Mat. Vopr. Kriptogr., 2015, 6:4, 5–21
|
D. S. Bogdanov, V. O. Mironkin
Data recovery for a neural network-based biometric authentication scheme
Mat. Vopr. Kriptogr., 2019, 10:2, 61–74
|
D. S. Bogdanov, V. I. Nozdrunov
Some properties of the DEC mode of operation of block ciphers
Mat. Vopr. Kriptogr., 2022, 13:3, 37–44
|
R. V. Bogonatov
Maximal and minimal representations over the Galois ring for the linear recurrent maximal period sequence over the Galois field
Mat. Vopr. Kriptogr., 2012, 3:4, 5–23
|
V. V. Borisenko
Transversals in splitted Latin squares of even order
Mat. Vopr. Kriptogr., 2014, 5:1, 5–25
|
V. V. Borisenko
On transversals of splitted Latin squares with identical substitution ${\chi_{ACDB}}$
Mat. Vopr. Kriptogr., 2020, 11:1, 9–26
|
V. V. Borisenko
$ k$-homogeneous Latin Squares, their transversals and condition of orthogonality
Mat. Vopr. Kriptogr., 2022, 13:3, 45–54
|
V. V. Borisenko
$k$-splitted and $k$-homogeneous Latin squares and their transversals
Mat. Vopr. Kriptogr., 2020, 11:3, 5–19
|
V. V. Borisenko
On transversals of homogeneous Latin squares
Mat. Vopr. Kriptogr., 2015, 6:3, 5–17
|
V. V. Borisenko
$k$-homogeneous Latin Squares, their transversals and condition of pseudo-orthogonality
Mat. Vopr. Kriptogr., 2023, 14:3, 75–84
|
A. A. Bozhko, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2023, 14:2, 7–24
|
A. A. Bozhko, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2021, 12:4, 5–23
|
A. D. Bugrov, O. V. Kamlovskii
Parameters of a class of functions over a finite field
Mat. Vopr. Kriptogr., 2018, 9:4, 31–52
|
S. M. Buravlev, M. M. Glukhov, A. M. Zubkov, A. P. Kovalenko, A. S. Kuzmin, V. N. Latyshev, A. I. Markov, V. N. Markov, Yu. I. Medvedev, V. G. Mikhailov, A. V. Mikhalev, A. A. Nechaev, B. A. Pogorelov, Yu. V. Prokhorov, V. N. Sachkov
V. L. Kurakin (13.05.1966 – 14.08.2010)
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
S. M. Buravlev, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
D. A. Burov, B. A. Pogorelov
An attack on $\mathrm{6}$ rounds of Khazad
Mat. Vopr. Kriptogr., 2016, 7:2, 35–46
|
D. A. Burov, B. A. Pogorelov
The permutation group insight on the diffusion property of linear mappings
Mat. Vopr. Kriptogr., 2018, 9:2, 47–58
|
D. A. Burov, B. A. Pogorelov
The influence of linear mapping reducibility on the choice of round constants
Mat. Vopr. Kriptogr., 2017, 8:2, 51–64
|
D. N. Bylkov
Reconstruction of a linear recurrence of maximal period over a Galois ring of characteristic $p^3$ by its highest digital sequence
Mat. Vopr. Kriptogr., 2014, 5:2, 29–35
|
D. N. Bylkov
A construction of new classes of filter generators without equivalent states
Mat. Vopr. Kriptogr., 2014, 5:4, 17–39
|
D. N. Bylkov, O. V. Kamlovskii
Parameters of Boolean functions generated by the most significant bits of linear recurrent sequences
Mat. Vopr. Kriptogr., 2012, 3:4, 25–53
|
I. V. Cherednik
Linear decomposition of discrete functions in terms of shift-composition operation
Mat. Vopr. Kriptogr., 2020, 11:1, 115–143
|
I. V. Cherednik
Development of one approach to constructing a set of block bijective transformations
Mat. Vopr. Kriptogr., 2021, 12:3, 49–66
|
I. V. Cherednik, see I. A. Kruglov
Mat. Vopr. Kriptogr., 2019, 10:4, 53–65
|
V. P. Chistyakov, see M. I. Tikhomirova
Mat. Vopr. Kriptogr., 2010, 1:1, 101–108
|
V. P. Chistyakov, see M. I. Tikhomirova
Mat. Vopr. Kriptogr., 2011, 2:1, 119–129
|
V. P. Chistyakov
On the asymptotic normality in a scheme of allocation of non-equiprobable particle sets
Mat. Vopr. Kriptogr., 2014, 5:4, 129–138
|
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
Mat. Vopr. Kriptogr., 2017, 8:1, 51–68
|
B. R. Danilov, see S. A. Lozhkin
Mat. Vopr. Kriptogr., 2017, 8:2, 87–96
|
S. A. Davydov, Yu. D. Shkuratov
Circulant matrices over $\mathbb{F}_2$ and their use for the construction of efficient linear transformations with high branch numbers
Mat. Vopr. Kriptogr., 2024, 15:2, 29–46
|
R. A. De La Krus Khimenes, see O. C. Puente
Mat. Vopr. Kriptogr., 2024, 15:1, 97–125
|
R. A. De La Krus Khimenes, see R. R. Aulet
Mat. Vopr. Kriptogr., 2021, 12:2, 57–74
|
R. A. de la Cruz Jiménez
On some properties of the curvature and nondegeneracy of Boolean functions
Mat. Vopr. Kriptogr., 2022, 13:2, 65–98
|
R. A. de la Cruz Jiménez
Constructing $8$-bit permutations, $8$-bit involutions and $8$-bit orthomorphisms with almost optimal cryptographic parameters
Mat. Vopr. Kriptogr., 2021, 12:3, 89–124
|
R. A. De La Krus Khimenes, see O. C. Puente
Mat. Vopr. Kriptogr., 2021, 12:4, 125–143
|
D. V. Denisenko, M. V. Nikitenkova
Optimization of $S$-boxes GOST R 34.12-2015 «Magma» quantum circuits without ancilla qubits
Mat. Vopr. Kriptogr., 2020, 11:2, 43–52
|
D. V. Denisenko
Quantum differential and linear cryptanalysis
Mat. Vopr. Kriptogr., 2021, 12:3, 67–88
|
O. V. Denisov
Difference characteristics of random maps and their compositions
Mat. Vopr. Kriptogr., 2024, 15:1, 5–20
|
O. V. Denisov
Spectral criterion for testing hypotheses on random permutations
Mat. Vopr. Kriptogr., 2016, 7:3, 19–28
|
O. V. Denisov
On the algorithm of detecting the essential arguments of random Boolean function
Mat. Vopr. Kriptogr., 2015, 6:3, 19–32
|
O. V. Denisov
Criteria for testing the hypothesis on a noisy functional dependency between random binary vectors and bits
Mat. Vopr. Kriptogr., 2022, 13:3, 55–76
|
O. V. Denisov
Multidimensional spectral criterion for testing hypotheses on random permutations
Mat. Vopr. Kriptogr., 2023, 14:3, 85–106
|
O. V. Denisov
Statistical estimation of the significant arguments set of the binary vector-function with corrupted values
Mat. Vopr. Kriptogr., 2014, 5:4, 41–61
|
A. A. Dmukh, D. M. Dygin, G. B. Marshalko
A lightweight-friendly modification of GOST block cipher
Mat. Vopr. Kriptogr., 2014, 5:2, 47–55
|
A. A. Dmukh
On the use of conjugacy of substitutions in determining the key in Feistel networks
Mat. Vopr. Kriptogr., 2018, 9:3, 33–44
|
A. Ya. Dorofeev
Solving systems of linear equations arising in the computation of logarithms in a finite prime field
Mat. Vopr. Kriptogr., 2012, 3:1, 5–51
|
V. O. Drelikhov
On the constructions of Markov maps
Mat. Vopr. Kriptogr., 2024, 15:1, 21–34
|
V. O. Drelikhov
Probabilistic properties of statistical dependencies between input and output of Markovian iterative cipher with round transformations on Abelian groups
Mat. Vopr. Kriptogr., 2021, 12:1, 59–82
|
V. O. Drelikhov, I. A. Kruglov
Local characteristics of smoothing properties of endomorphisms of finite Abelian groups
Mat. Vopr. Kriptogr., 2015, 6:3, 33–45
|
O. Duman, see R. AlTawy
Mat. Vopr. Kriptogr., 2016, 7:2, 21–34
|
D. M. Dygin, I. V. Lavrikov, G. B. Marshalko, V. I. Rudskoy, D. I. Trifonov, V. A. Shishkin
On a new Russian Encryption Standard
Mat. Vopr. Kriptogr., 2015, 6:2, 29–34
|
D. M. Dygin, see A. A. Dmukh
Mat. Vopr. Kriptogr., 2014, 5:2, 47–55
|
D. M. Dygin, S. V. Grebnev
Efficient implementation of the GOST R 34.10 digital signature scheme using modern approaches to elliptic curve scalar multiplication
Mat. Vopr. Kriptogr., 2013, 4:2, 47–57
|
T. Eghlidos, see S. Karimani
Mat. Vopr. Kriptogr., 2019, 10:2, 97–106
|
V. P. Elizarov
On classes of solvable rings
Mat. Vopr. Kriptogr., 2010, 1:3, 19–26
|
D. M. Ermilov, O. A. Kozlitin
Cyclic structure of a polynomial generator over the Galois ring
Mat. Vopr. Kriptogr., 2013, 4:1, 27–57
|
D. M. Ermilov, O. A. Kozlitin
On the structure of graph of polynomial transformation of the Galois ring
Mat. Vopr. Kriptogr., 2015, 6:3, 47–73
|
D. M. Ermilov
The number of maximal period polynomial mappings over the Galois fields of odd characteristics
Mat. Vopr. Kriptogr., 2018, 9:4, 85–100
|
A. V. Erokhin, F. M. Malyshev, A. E. Trishin
Multidimensional linear method and diffusion characteristics of linear medium of ciphering transform
Mat. Vopr. Kriptogr., 2017, 8:4, 29–62
|
V. A. Fedchenko
On the linear and differential cryptanalysis of the AES-like ciphers
Mat. Vopr. Kriptogr., 2020, 11:3, 101–120
|
V. A. Fedchenko
Diffusion rates of linear medium in AES-like ciphers
Mat. Vopr. Kriptogr., 2017, 8:3, 109–126
|
V. A. Fedchenko
Minimal consistent systems of local probabilistic relations for AES-like ciphers
Mat. Vopr. Kriptogr., 2018, 9:3, 127–142
|
A. K. Fedorov, see M. A. Kudinov
Mat. Vopr. Kriptogr., 2021, 12:2, 129–145
|
S. N. Fedorov
On a new classification of Boolean functions
Mat. Vopr. Kriptogr., 2019, 10:2, 159–168
|
E. D. Fiallo
A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes
Mat. Vopr. Kriptogr., 2021, 12:4, 99–113
|
V. M. Fomichev, A. M. Koreneva, A. R. Miftakhutdinova, D. I. Zadorozhny
Evaluation of the maximum performance of block encryption algorithms
Mat. Vopr. Kriptogr., 2019, 10:2, 181–191
|
D. B. Fomin
A timing attack on CUDA implementations of an AES-type block cipher
Mat. Vopr. Kriptogr., 2016, 7:2, 121–130
|
D. B. Fomin
New classes of $8$-bit permutations based on a butterfly structure
Mat. Vopr. Kriptogr., 2019, 10:2, 169–180
|
D. B. Fomin, see O. D. Avraamova
Mat. Vopr. Kriptogr., 2021, 12:2, 21–38
|
D. B. Fomin, M. A. Kovrizhnykh
On differential uniformity of permutations derived using a generalized construction
Mat. Vopr. Kriptogr., 2022, 13:2, 37–52
|
D. B. Fomin
Implementation of an XSL block cipher with MDS-matrix linear transformation on NVIDIA CUDA
Mat. Vopr. Kriptogr., 2015, 6:2, 99–108
|
D. B. Fomin
Construction of permutations on the space $V_{2m}$ by means of $(2m,m)$-functions
Mat. Vopr. Kriptogr., 2020, 11:3, 121–138
|
D. B. Fomin
On the algebraic degree and differential uniformity of permutations on the space $V_{2m}$ constructed via $(2m,m)$-functions
Mat. Vopr. Kriptogr., 2020, 11:4, 133–149
|
A. V. Galatenko, V. A. Nosov, A. E. Pankratiev, K. D. Tsaregorodtsev
Proper families of functions and their applications
Mat. Vopr. Kriptogr., 2023, 14:2, 43–58
|
A. M. Gerasimovich, see V. I. Korzhik
Mat. Vopr. Kriptogr., 2021, 12:3, 125–141
|
M. M. Glukhov
On $2$-transitive products of three regular permutation groups of a finite field
Mat. Vopr. Kriptogr., 2019, 10:1, 11–26
|
M. M. Glukhov
On application of class groups of ideals of quadratic fields to the construction of public key cryptosystems
Mat. Vopr. Kriptogr., 2010, 1:1, 23–54
|
M. M. Gluhov
On mixing linear transforms for block ciphers
Mat. Vopr. Kriptogr., 2011, 2:2, 5–39
|
M. M. Glukhov, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
M. M. Glukhov
On the matrices of transitions of differences for some modular groups
Mat. Vopr. Kriptogr., 2013, 4:4, 27–47
|
M. M. Glukhov
On the approximation of discrete functions by linear functions
Mat. Vopr. Kriptogr., 2016, 7:4, 29–50
|
M. M. Glukhov
An analysis of some key distribution public systems based on non-abelian groups
Mat. Vopr. Kriptogr., 2010, 1:4, 5–22
|
M. M. Gluhov
On a method of construction of orthogonal quasigroup systems by means of groups
Mat. Vopr. Kriptogr., 2011, 2:4, 5–24
|
M. A. Goltvanitsa
New representaions of elements of skew linear recurrent sequences via trace function based on the noncommutative Hamilton – Cayley theorem
Mat. Vopr. Kriptogr., 2021, 12:1, 23–57
|
M. A. Goltvanitsa
Representations of skew linear recurrent sequences of maximal period over finite field
Mat. Vopr. Kriptogr., 2023, 14:1, 27–43
|
M. A. Goltvanitsa
Skew $\sigma$-splittable linear recurrent sequences with maximal period
Mat. Vopr. Kriptogr., 2022, 13:1, 33–67
|
M. A. Goltvanitsa
Digit sequences of skew linear recurrences of maximal period over Galois rings
Mat. Vopr. Kriptogr., 2015, 6:2, 19–27
|
M. A. Goltvanitsa
A construction of skew LRS of maximal period over finite fields based on the defining tuples of factors
Mat. Vopr. Kriptogr., 2014, 5:2, 37–46
|
M. A. Goltvanitsa, A. A. Nechaev, S. N. Zaitsev
Skew LRS of maximal period over Galois rings
Mat. Vopr. Kriptogr., 2013, 4:2, 59–72
|
M. A. Goltvanitsa
Non-commutative Hamilton–Cayley theorem and roots of characteristic polynomials of skew maximal period linear recurrences over Galois rings
Mat. Vopr. Kriptogr., 2017, 8:2, 65–76
|
M. A. Goltvanitsa
Equidistant filters based on skew ML-sequences over fields
Mat. Vopr. Kriptogr., 2018, 9:2, 71–86
|
M. A. Goltvanitsa
The first digit sequence of skew linear recurrence of maximal period over Galois ring
Mat. Vopr. Kriptogr., 2016, 7:3, 5–18
|
M. A. Goltvanitsa
Elementary Abelian regular subgroups of vector space affine group related to cryptanalysis. II
Mat. Vopr. Kriptogr., 2024, 15:3, 9–47
|
M. A. Goltvanitsa
Elementary Abelian regular subgroups of vector space affine group related to cryptanalysis
Mat. Vopr. Kriptogr., 2023, 14:4, 25–53
|
M. A. Goltvanitsa
Methods of construction of skew linear recurrent sequences with maximal period based on the Galois polynomials factorization in the ring of matrix polynomials
Mat. Vopr. Kriptogr., 2019, 10:4, 25–51
|
S. P. Gorshkov, A. V. Tarasov
On the weights of Boolean functions representable by $2$-CNF or $3$-CNF
Mat. Vopr. Kriptogr., 2018, 9:1, 5–26
|
S. P. Gorshkov
Functions from Schaefer classes having negations belonging to other Schaefer classes
Mat. Vopr. Kriptogr., 2015, 6:4, 23–48
|
S. P. Gorshkov, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
S. P. Gorshkov
Investigation of some subclasses of multiaffine, bijunctive, weakly positive and weakly negative Boolean functions
Mat. Vopr. Kriptogr., 2016, 7:4, 51–66
|
S. V. Grebnev
Limonnitsa: making Limonnik-3 post-quantum
Mat. Vopr. Kriptogr., 2020, 11:2, 25–42
|
S. V. Grebnev, see D. M. Dygin
Mat. Vopr. Kriptogr., 2013, 4:2, 47–57
|
S. V. Grebnev
Optimizing memory cost of multi-scalar multiplication
Mat. Vopr. Kriptogr., 2016, 7:2, 53–60
|
A. B. Gribov, P. A. Zolotykh, A. V. Mikhalev
A construction of algebraic cryptosystem over the quasigroup ring
Mat. Vopr. Kriptogr., 2010, 1:4, 23–32
|
A. M. Guselev
Security properties of one “short” signature scheme
Mat. Vopr. Kriptogr., 2022, 13:2, 53–64
|
A. M. Guselev
Application of the lattice theory to the analysis of digital signature schemes
Mat. Vopr. Kriptogr., 2018, 9:4, 73–84
|
V. V. Gusev
Legal messages for some message authentication functions in block ciphers
Mat. Vopr. Kriptogr., 2018, 9:1, 27–46
|
V. V. Gusev
Legal messages for the GOST R 34.13-2015 block cipher modes
Mat. Vopr. Kriptogr., 2019, 10:3, 33–47
|
M. Hamann, M. Krause, A. Moch
Improving OBDD attacks against stream ciphers
Mat. Vopr. Kriptogr., 2020, 11:2, 137–151
|
A. V. Ivanov
Noncloseness of hyper-bent-function class under the general linear group action
Mat. Vopr. Kriptogr., 2012, 3:2, 5–26
|
A. V. Ivanov
Asymptotically optimal criteria for testing parametric hypothesis on the distribution of a random vector. I
Mat. Vopr. Kriptogr., 2015, 6:3, 89–116
|
A. V. Ivanov
Asymptotically optimal criteria for testing hypotheses on the distribution of a random vector. II
Mat. Vopr. Kriptogr., 2015, 6:4, 49–64
|
G. I. Ivchenko, Yu. I. Medvedev
Partitions without small blocks and $r$-associated Bell polynomials in a parametric model: probabilistic-statistical analysis
Mat. Vopr. Kriptogr., 2019, 10:1, 27–40
|
G. I. Ivchenko, see A. M. Zubkov
Mat. Vopr. Kriptogr., 2020, 11:1, 27–46
|
G. I. Ivchenko, Yu. I. Medvedev, V. A. Mironova
Krawtchouk polynomials and their applications in cryptography and coding theory
Mat. Vopr. Kriptogr., 2015, 6:1, 33–56
|
G. I. Ivchenko, Yu. I. Medvedev
Random $A$-permutations in a parametric model
Mat. Vopr. Kriptogr., 2024, 15:1, 35–55
|
G. I. Ivchenko, Yu. I. Medvedev
Properties of the structure of random partitions of a finite set in parametric model
Mat. Vopr. Kriptogr., 2023, 14:1, 45–63
|
G. I. Ivchenko, Yu. I. Medvedev
Parametric models of $r$-permutations and $r$-partitions and their probabilistic-statistical analysis
Mat. Vopr. Kriptogr., 2018, 9:1, 47–64
|
G. I. Ivchenko, Yu. I. Medvedev, V. A. Mironova
The structure of Boolean functions spectra
Mat. Vopr. Kriptogr., 2016, 7:1, 57–70
|
G. I. Ivchenko, Yu. I. Medvedev, V. A. Mironova
Analysis of the spectrum of random symmetric Boolean functions
Mat. Vopr. Kriptogr., 2013, 4:1, 59–76
|
G. I. Ivchenko, Yu. I. Medvedev
Spectrum of random Boolean function and its generating function
Mat. Vopr. Kriptogr., 2011, 2:2, 41–53
|
G. I. Ivchenko, Yu. I. Medvedev
Stochastic Boolean functions and their spectra
Mat. Vopr. Kriptogr., 2012, 3:3, 21–34
|
G. I. Ivchenko, Yu. I. Medvedev
Parametric models for random combinatorial objects of exponential type and their probabilistic-statistical analysis
Mat. Vopr. Kriptogr., 2017, 8:3, 41–56
|
G. I. Ivchenko, Yu. I. Medvedev
Records in random permutations
Mat. Vopr. Kriptogr., 2024, 15:3, 49–66
|
G. I. Ivchenko, Yu. I. Medvedev
Random partitions with two-side bounds and $(r,s)$-Bell polynomials in a parametric probabilistic model
Mat. Vopr. Kriptogr., 2022, 13:3, 77–92
|
G. I. Ivchenko, Yu. I. Medvedev
Multiparametric models of random partitions. Limit distributions and statistical inference
Mat. Vopr. Kriptogr., 2022, 13:4, 37–51
|
G. I. Ivchenko, Yu. I. Medvedev, V. A. Mironova
Symmetric Boolean functions and their metric properties matrices of transitions of differences when using some modular groups
Mat. Vopr. Kriptogr., 2013, 4:4, 49–63
|
G. I. Ivchenko, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
M. M. Kabardov, see V. I. Korzhik
Mat. Vopr. Kriptogr., 2021, 12:3, 125–141
|
O. V. Kamlovskiy
Cross-correlation coefficients for digit sequences of uniform linear recurrent sequences over the residue ring
Mat. Vopr. Kriptogr., 2020, 11:1, 47–62
|
O. V. Kamlovskiy
On the Hamming distance between binary representations of linear recurrent sequences over field $GF(2^k)$ and ring $\mathbb{Z}_{2^n}$
Mat. Vopr. Kriptogr., 2016, 7:1, 71–82
|
O. V. Kamlovsky
Nonabsolute bounds for incomplete exponential sums of elements of linear recurrent sequences and their applications
Mat. Vopr. Kriptogr., 2014, 5:3, 17–34
|
O. V. Kamlovskiy
Nonlinearity of a class of Boolean functions constructed using significant bits of linear recurrences over the ring $\mathbb Z_{2^n}$
Mat. Vopr. Kriptogr., 2016, 7:3, 29–46
|
O. V. Kamlovskii
The number of different $r$-patterns in linear recurrent sequences over Galois rings
Mat. Vopr. Kriptogr., 2013, 4:3, 49–82
|
O. V. Kamlovskii, V. V. Mizerov
Frequency characteristics of sequences generated by the stream encryption algorithm GEA-1
Mat. Vopr. Kriptogr., 2024, 15:3, 67–82
|
O. V. Kamlovskii, V. V. Mizerov
Properties of the output sequences of a combination generators over finite fields
Mat. Vopr. Kriptogr., 2020, 11:4, 23–47
|
O. V. Kamlovskii, see A. R. Vasin
Mat. Vopr. Kriptogr., 2021, 12:4, 25–41
|
O. V. Kamlovskii, see D. N. Bylkov
Mat. Vopr. Kriptogr., 2012, 3:4, 25–53
|
O. V. Kamlovskii, see A. D. Bugrov
Mat. Vopr. Kriptogr., 2018, 9:4, 31–52
|
O. V. Kamlovskii
Exponential sums method for frequencies of most significant bit $r$-patterns in linear recurrent sequences over $\mathbb{Z}_{2^n}$
Mat. Vopr. Kriptogr., 2010, 1:4, 33–62
|
O. V. Kamlovskii, V. V. Mizerov
Distribution properties in the sum of linear recurring and the counter sequences over Galois rings
Mat. Vopr. Kriptogr., 2022, 13:4, 53–67
|
O. V. Kamlovskiy
Distribution properties of rows and columns for matrix linear recurrent sequences of the first order
Mat. Vopr. Kriptogr., 2015, 6:4, 65–76
|
O. V. Kamlovskii, V. V. Mizerov
Cross-correlation function for the representations of one class of sequences over Galois rings
Mat. Vopr. Kriptogr., 2023, 14:4, 71–88
|
O. V. Kamlovskii
The sum of modules of Walsh coefficients for some balanced Boolean functions
Mat. Vopr. Kriptogr., 2017, 8:4, 75–98
|
M. Kaplan
Quantum attacks against iterated block ciphers
Mat. Vopr. Kriptogr., 2016, 7:2, 71–90
|
E. K. Karelina, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2018, 9:2, 7–22
|
S. Karimani, Z. Naghdabadi, T. Eghlidos, M. R. Aref
An LWE-based verifiable threshold secret sharing scheme
Mat. Vopr. Kriptogr., 2019, 10:2, 97–106
|
G. A. Karpunin, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2018, 9:2, 23–46
|
G. A. Karpunin, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2019, 10:2, 47–60
|
G. A. Karpunin, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2023, 14:3, 49–73
|
S. Yu. Katyshev, see A. V. Baryshnikov
Mat. Vopr. Kriptogr., 2017, 8:1, 7–12
|
S. Yu. Katyshev, A. V. Zyazin, A. V. Baryshnikov
Application of non-associative structures for construction of homomorphic cryptosystems
Mat. Vopr. Kriptogr., 2020, 11:3, 31–39
|
S. Yu. Katyshev, see A. V. Baryshnikov
Mat. Vopr. Kriptogr., 2018, 9:4, 5–30
|
O. V. Kazymyrov, V. N. Kazymyrova, R. V. Oliynykov
A method for generation of high-nonlinear S-boxes based on gradient descent
Mat. Vopr. Kriptogr., 2014, 5:2, 71–78
|
V. N. Kazymyrova, see O. V. Kazymyrov
Mat. Vopr. Kriptogr., 2014, 5:2, 71–78
|
Yu. S. Kharin
Parsimonious models of high-order Markov chains for evaluation of cryptographic generators
Mat. Vopr. Kriptogr., 2016, 7:2, 131–142
|
G. I. Khoruzhenko, see M. A. Pudovkina
Mat. Vopr. Kriptogr., 2013, 4:2, 113–125
|
G. I. Khoruzhenko, see M. A. Pudovkina
Mat. Vopr. Kriptogr., 2013, 4:2, 127–152
|
E. O. Kiktenko, see M. A. Kudinov
Mat. Vopr. Kriptogr., 2021, 12:2, 129–145
|
V. A. Kiryukhin
On the security aspects of protocol CRISP
Mat. Vopr. Kriptogr., 2024, 15:1, 57–81
|
V. A. Kiryukhin
Exact maximum expected differential and linear probability for $2$-round Kuznyechik
Mat. Vopr. Kriptogr., 2019, 10:2, 107–116
|
V. A. Kiryukhin
About «$k$-bit security» of MACs based on hash function Streebog
Mat. Vopr. Kriptogr., 2024, 15:2, 47–68
|
V. A. Kiryukhin
Related-key attack on 5-round Kuznyechik
Mat. Vopr. Kriptogr., 2020, 11:2, 53–67
|
V. A. Kiryukhin
Related-key attacks on the compression function of Streebog
Mat. Vopr. Kriptogr., 2023, 14:2, 59–76
|
V. A. Kiryukhin
Keyed Streebog is a secure PRF and MAC
Mat. Vopr. Kriptogr., 2023, 14:2, 77–96
|
V. A. Kiryukhin
An algorithm for computing the upper bound for non-minimum weight differentials in 2-round LSX-ciphers
Mat. Vopr. Kriptogr., 2021, 12:2, 93–109
|
V. A. Kiryukhin
Streebog compression function as PRF in secret-key settings
Mat. Vopr. Kriptogr., 2022, 13:2, 99–116
|
A. V. Knyazev, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
N. A. Kolomeec
A graph of minimal distances between bent functions
Mat. Vopr. Kriptogr., 2016, 7:2, 103–110
|
N. A. Kolomeec
On a property of quadratic Boolean functions
Mat. Vopr. Kriptogr., 2014, 5:2, 79–85
|
V. A. Kopytcev, V. G. Mikhailov
Explicit accuracy estimates for the Poisson approximation to the distribution of the number of solutions of random inclusions
Mat. Vopr. Kriptogr., 2015, 6:1, 57–79
|
V. A. Kopytcev, V. G. Mikhailov
On an asymptotical property of spheres in the discrete spaces of large dimension
Mat. Vopr. Kriptogr., 2014, 5:1, 73–83
|
V. A. Kopyttsev
Reliability estimate of the maximum likelihood method used for the solution of systems of equations with distorted right parts
Mat. Vopr. Kriptogr., 2024, 15:1, 83–95
|
V. A. Kopytcev, V. G. Mikhailov
On the distribution of the numbers of solutions of random inclusions
Mat. Vopr. Kriptogr., 2011, 2:2, 55–80
|
V. A. Kopyttsev
Reliability estimate of the maximum likelihood method used for the solution of systems of equations with distorted right parts
Mat. Vopr. Kriptogr., 2023, 14:3, 107–117
|
V. A. Kopytcev, V. G. Mikhailov
Conditions of convergence to the Poisson distribution for the number of solutions of random inclusions
Mat. Vopr. Kriptogr., 2012, 3:3, 35–55
|
V. A. Kopyttsev
On a threshold effect for the mean number of solutions of systems of random equations
Mat. Vopr. Kriptogr., 2019, 10:3, 67–80
|
V. A. Kopyttsev, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
V. A. Kopyttsev, V. G. Mikhailov
Poisson type theorems for the number of solutions of random inclusions
Mat. Vopr. Kriptogr., 2010, 1:4, 63–84
|
V. A. Kopytcev
A multivariate Poisson theorem for the number of solutions of random inclusions close to given vectors
Mat. Vopr. Kriptogr., 2016, 7:4, 67–80
|
V. A. Kopytcev
Limit theorems on the normal distribution for the number of solutions of nonlinear inclusions
Mat. Vopr. Kriptogr., 2020, 11:4, 77–96
|
A. M. Koreneva, see V. M. Fomichev
Mat. Vopr. Kriptogr., 2019, 10:2, 181–191
|
V. I. Korzhik, V. S. Starostin, M. M. Kabardov, A. M. Gerasimovich, V. A. Yakovlev, A. G. Zhuvikin
Information theoretically secure key sharing protocol executing with constant noiseless public channels
Mat. Vopr. Kriptogr., 2021, 12:3, 125–141
|
D. I. Koshelev
Faster point compression for elliptic curves of $j$-invariant $0$
Mat. Vopr. Kriptogr., 2021, 12:4, 115–123
|
Yu. V. Kosolapov
Blakley type secret sharing scheme based on the intersection of subspaces
Mat. Vopr. Kriptogr., 2017, 8:1, 13–30
|
Yu. V. Kosolapov, O. Yu. Turchenko
IND-CCA2 secure McEliece-type modification in the standard model
Mat. Vopr. Kriptogr., 2021, 12:2, 111–128
|
Yu. V. Kosolapov, E. A. Lelyuk
The McEliece-type cryptosystem based on $D$-codes
Mat. Vopr. Kriptogr., 2024, 15:2, 69–90
|
A. P. Kovalenko, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
A. P. Kovalenko, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
M. A. Kovrizhnykh, see D. B. Fomin
Mat. Vopr. Kriptogr., 2022, 13:2, 37–52
|
A. A. Kozhevnikov, S. V. Polikarpov, K. E. Rumyantsev
On differential properties of a symmetric cryptoalgorithm based on pseudo-dynamic substitutions
Mat. Vopr. Kriptogr., 2016, 7:2, 91–102
|
O. A. Kozlitin, see D. M. Ermilov
Mat. Vopr. Kriptogr., 2013, 4:1, 27–57
|
O. A. Kozlitin
Constructing pseudorandom sequences by means of $2$-linear shift register
Mat. Vopr. Kriptogr., 2014, 5:1, 39–72
|
O. A. Kozlitin
Periodical properties of multidimensional polynomial generator over Galois ring. II
Mat. Vopr. Kriptogr., 2020, 11:1, 63–100
|
O. A. Kozlitin
Periodical properties of multidimensional polynomial transformations of Galois – Eisenstein ring
Mat. Vopr. Kriptogr., 2022, 13:1, 69–99
|
O. A. Kozlitin
$2$-linear shift register over the Galois ring of even characteristic
Mat. Vopr. Kriptogr., 2012, 3:2, 27–61
|
O. A. Kozlitin, see D. M. Ermilov
Mat. Vopr. Kriptogr., 2015, 6:3, 47–73
|
O. A. Kozlitin
Pseudorandom sequence generators based on shift registers over finite chain rings
Mat. Vopr. Kriptogr., 2019, 10:3, 49–65
|
O. A. Kozlitin
Parallel decomposition of nonautonomous 2-linear shift registers
Mat. Vopr. Kriptogr., 2011, 2:3, 5–29
|
O. A. Kozlitin
Probabilistic linear relations in binary recurring sequences
Mat. Vopr. Kriptogr., 2017, 8:3, 57–84
|
O. A. Kozlitin
Periodic properties of multidimensional polynomial generator over the Galois ring. I
Mat. Vopr. Kriptogr., 2018, 9:3, 61–98
|
O. A. Kozlitin
Remote voting protocols. II
Mat. Vopr. Kriptogr., 2024, 15:3, 83–100
|
O. A. Kozlitin
Periodical properties of multidimensional polynomial generator over Galois ring. III
Mat. Vopr. Kriptogr., 2020, 11:4, 49–76
|
O. A. Kozlitin, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
O. A. Kozlitin
Periodical properties of multidimensional polynomial generator over Galois ring. IV
Mat. Vopr. Kriptogr., 2022, 13:4, 69–95
|
O. A. Kozlitin, M. A. Suleymanov
Remote voting protocols. I
Mat. Vopr. Kriptogr., 2023, 14:4, 89–110
|
M. Krause, see M. Hamann
Mat. Vopr. Kriptogr., 2020, 11:2, 137–151
|
K. S. Kravtsov, S. P. Kulik, I. V. Radchenko
Quantum random number generator
Mat. Vopr. Kriptogr., 2016, 7:2, 111–114
|
D. A. Kronberg
New methods of error correction in quantum cryptography using low-density parity-check codes
Mat. Vopr. Kriptogr., 2017, 8:2, 77–86
|
D. A. Kronberg
A quantum scheme for attack on a phase-time encoded quantum cryptography protocol
Mat. Vopr. Kriptogr., 2024, 15:2, 91–100
|
I. A. Kruglov
Convergence of transition matrices of some Markov chains on finite Abelian group to the uniform matrix
Mat. Vopr. Kriptogr., 2017, 8:1, 31–50
|
I. A. Kruglov
Rate of convergence to the uniform distribution for autoregression scheme on the finite Abelian group
Mat. Vopr. Kriptogr., 2018, 9:1, 65–74
|
I. A. Kruglov
The estimate of the convergence rate to the uniform distribution for products of elements of finite group controlled by a Markov chain
Mat. Vopr. Kriptogr., 2014, 5:1, 85–94
|
I. A. Kruglov
Conditions of limit uniformity of shift register state distribution
Mat. Vopr. Kriptogr., 2010, 1:2, 19–29
|
I. A. Kruglov, see V. N. Sachkov
Mat. Vopr. Kriptogr., 2019, 10:3, 101–116
|
I. A. Kruglov
On the homomorphisms of strongly connected finite automata into substitution automata
Mat. Vopr. Kriptogr., 2011, 2:3, 31–46
|
I. A. Kruglov, see V. O. Drelikhov
Mat. Vopr. Kriptogr., 2015, 6:3, 33–45
|
I. A. Kruglov, see V. N. Sachkov
Mat. Vopr. Kriptogr., 2018, 9:4, 101–124
|
I. A. Kruglov
Autoregression on a finite Abelian group controlled by a Markov chain
Mat. Vopr. Kriptogr., 2011, 2:4, 25–36
|
I. A. Kruglov, I. V. Cherednik
On the existence of non-negative bases in subgroups of free groups of Schreier varieties
Mat. Vopr. Kriptogr., 2019, 10:4, 53–65
|
I. A. Kruglov, see V. N. Sachkov
Mat. Vopr. Kriptogr., 2016, 7:4, 95–116
|
V. I. Kruglov, see A. M. Zubkov
Mat. Vopr. Kriptogr., 2014, 5:1, 27–38
|
V. I. Kruglov, see V. G. Mikhailov
Mat. Vopr. Kriptogr., 2023, 14:1, 85–97
|
V. I. Kruglov
Poisson approximation for the distribution of the number of “parallelograms” in a random sample from $\mathbb Z_N^q$
Mat. Vopr. Kriptogr., 2012, 3:2, 63–78
|
V. I. Kruglov
Two Lempel – Ziv goodness-of-fit tests for nonequiprobable random binary sequences
Mat. Vopr. Kriptogr., 2023, 14:2, 97–110
|
V. I. Kruglov, see A. M. Zubkov
Mat. Vopr. Kriptogr., 2018, 9:2, 99–102
|
V. I. Kruglov, V. G. Mikhailov
On the rank of random matrix over prime field consisting of independent rows with given numbers of nonzero elements
Mat. Vopr. Kriptogr., 2020, 11:3, 41–52
|
V. I. Kruglov, see V. G. Mikhailov
Mat. Vopr. Kriptogr., 2022, 13:3, 93–106
|
V. I. Kruglov, see A. M. Zubkov
Mat. Vopr. Kriptogr., 2012, 3:4, 55–70
|
V. I. Kruglov, see V. G. Mikhailov
Mat. Vopr. Kriptogr., 2021, 12:4, 59–64
|
V. I. Kruglov, V. G. Mikhailov
On the rank of random binary matrix with fixed weights of independent rows
Mat. Vopr. Kriptogr., 2019, 10:4, 67–76
|
M. A. Kudinov, E. O. Kiktenko, A. K. Fedorov
Security analysis of the W-OTS$^+$ signature scheme: Updating security bounds
Mat. Vopr. Kriptogr., 2021, 12:2, 129–145
|
S. P. Kulik, see K. S. Kravtsov
Mat. Vopr. Kriptogr., 2016, 7:2, 111–114
|
V. L. Kurakin
Free shift registers. IV
Mat. Vopr. Kriptogr., 2010, 1:2, 57–92
|
V. L. Kurakin
Family of maximal period sequences with low cross-correlation over an 8-element ring
Mat. Vopr. Kriptogr., 2011, 2:3, 47–73
|
V. L. Kurakin
A family of sequences over the $8$-element ring with low correlation
Mat. Vopr. Kriptogr., 2010, 1:4, 85–109
|
A. V. Kurochkin
On some properties of an XSL-network
Mat. Vopr. Kriptogr., 2019, 10:2, 117–124
|
A. S. Kuz'min, G. B. Marshalko, A. A. Nechaev
Reconstruction of linear recurrent sequence over prime residue ring from its image
Mat. Vopr. Kriptogr., 2010, 1:2, 31–56
|
A. S. Kuz'min
Information on the Workshop CTCrypt-2014
Mat. Vopr. Kriptogr., 2015, 6:2, 5
|
A. S. Kuzmin, G. B. Marshalko
Reconstruction of linear recurrent sequence over prime residue ring from its image. II
Mat. Vopr. Kriptogr., 2011, 2:2, 81–93
|
A. S. Kuz'min, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
A. V. Lapshin, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
V. N. Latyshev, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
T. A. Lavrenteva, S. V. Matveev
Side-channel attacks countermeasure based on decomposed S-boxes for Kuznyechik
Mat. Vopr. Kriptogr., 2021, 12:2, 147–157
|
I. V. Lavrikov, V. A. Shishkin
How much data may be safely processed on one key in different modes?
Mat. Vopr. Kriptogr., 2019, 10:2, 125–134
|
I. V. Lavrikov, see D. M. Dygin
Mat. Vopr. Kriptogr., 2015, 6:2, 29–34
|
R. F. Leal, see O. C. Puente
Mat. Vopr. Kriptogr., 2024, 15:1, 97–125
|
P. A. Lebedev
Comparison of old and new cryptographic hash function standards of the Russian Federation on CPUs and NVIDIA GPUs
Mat. Vopr. Kriptogr., 2013, 4:2, 73–80
|
E. A. Lelyuk, see Yu. V. Kosolapov
Mat. Vopr. Kriptogr., 2024, 15:2, 69–90
|
H. Linh, see N. Cuong
Mat. Vopr. Kriptogr., 2017, 8:1, 51–68
|
V. S. Litvinenko, A. V. Tarasov
Schaefer classes, Post classes and Galois connections
Mat. Vopr. Kriptogr., 2015, 6:1, 81–107
|
O. A. Logachev, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2018, 9:2, 7–22
|
N. Long, see N. Cuong
Mat. Vopr. Kriptogr., 2017, 8:1, 51–68
|
S. A. Lozhkin, M. S. Shupletsov, B. R. Danilov
Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference
Mat. Vopr. Kriptogr., 2017, 8:2, 87–96
|
I. V. Lysakov
Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method
Mat. Vopr. Kriptogr., 2023, 14:2, 111–122
|
A. Yu. Maksimovskiy
On the group properties of substitutions defined on the subgroup cosets of finite Abelian group of composite order
Mat. Vopr. Kriptogr., 2016, 7:1, 83–92
|
M. U. Malov
The number of appearances of elements on segments of linear recurrent sequences over Galois rings
Mat. Vopr. Kriptogr., 2023, 14:3, 119–126
|
E. S. Malygina, S. A. Novoselov
Division polynomials for hyperelliptic curves defined by Dickson polynomials
Mat. Vopr. Kriptogr., 2020, 11:2, 69–81
|
F. M. Malyshev
The complexity of initial state recovery for a class of filter generators
Mat. Vopr. Kriptogr., 2015, 6:1, 109–116
|
F. M. Malyshev
Basises of integers under the multiplace shift operations
Mat. Vopr. Kriptogr., 2011, 2:1, 29–73
|
F. M. Malyshev
Probabilistic characteristics of differential and linear relations for nonhomogeneous linear medium
Mat. Vopr. Kriptogr., 2019, 10:1, 41–72
|
F. M. Malyshev
Embedding of provably unsolvable problems into stream ciphers
Mat. Vopr. Kriptogr., 2023, 14:1, 65–83
|
F. M. Malyshev
Cryptographically weak filter function for trinomial linear recurrent sequences
Mat. Vopr. Kriptogr., 2017, 8:1, 69–80
|
F. M. Malyshev, A. E. Trishin
Linear and differential cryptanalysis: Another viewpoint
Mat. Vopr. Kriptogr., 2020, 11:2, 83–98
|
F. M. Malyshev
Doubly transitive XLS-families of permutations
Mat. Vopr. Kriptogr., 2010, 1:2, 93–103
|
F. M. Malyshev
The duality of differential and linear methods in cryptography
Mat. Vopr. Kriptogr., 2014, 5:3, 35–47
|
F. M. Malyshev, D. I. Trifonov
Diffusion properties of XSLP-ciphers
Mat. Vopr. Kriptogr., 2016, 7:3, 47–60
|
F. M. Malyshev
Metric properties of embeddings of the set of integers into the cylider
Mat. Vopr. Kriptogr., 2012, 3:3, 57–79
|
F. M. Malyshev
Functional circuits defining families of permutations of the space $GF(2)^N$
Mat. Vopr. Kriptogr., 2019, 10:3, 81–87
|
F. M. Malyshev
Three series of $5$-configurations
Mat. Vopr. Kriptogr., 2013, 4:3, 83–97
|
F. M. Malyshev, see A. V. Erokhin
Mat. Vopr. Kriptogr., 2017, 8:4, 29–62
|
F. M. Malyshev
Probabilistic relations for transformations of finite vector spaces
Mat. Vopr. Kriptogr., 2021, 12:4, 43–58
|
F. M. Malyshev
Four infinite series of $k$-configurations
Mat. Vopr. Kriptogr., 2013, 4:4, 65–75
|
F. M. Malyshev
Differential characteristics of base operations in ARX-ciphers
Mat. Vopr. Kriptogr., 2020, 11:4, 97–105
|
V. V. Marchuk, see S. V. Agievich
Mat. Vopr. Kriptogr., 2017, 8:2, 7–28
|
A. I. Markov, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
V. N. Markov, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
G. B. Marshalko, see D. M. Dygin
Mat. Vopr. Kriptogr., 2015, 6:2, 29–34
|
G. B. Marshalko, see A. S. Kuz'min
Mat. Vopr. Kriptogr., 2010, 1:2, 31–56
|
G. B. Marshalko, see A. A. Dmukh
Mat. Vopr. Kriptogr., 2014, 5:2, 47–55
|
G. B. Marshalko, see A. S. Kuz'min
Mat. Vopr. Kriptogr., 2011, 2:2, 81–93
|
G. B. Marshalko
On the security of a neural network-based biometric authentication scheme
Mat. Vopr. Kriptogr., 2014, 5:2, 87–98
|
G. B. Marshalko, V. I. Rudskoy
Key distribution. Episode 1: Quantum menace
Mat. Vopr. Kriptogr., 2020, 11:2, 99–110
|
S. S. Martynov
NP-completeness of special string editing problems
Mat. Vopr. Kriptogr., 2013, 4:4, 77–93
|
A. S. Maslov, see S. V. Agievich
Mat. Vopr. Kriptogr., 2017, 8:2, 7–28
|
S. V. Matveev, see T. A. Lavrenteva
Mat. Vopr. Kriptogr., 2021, 12:2, 147–157
|
S. V. Matveev
GOST 28147-89 masking against side channel attacks
Mat. Vopr. Kriptogr., 2015, 6:2, 35–43
|
D. V. Matyukhin, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
D. V. Matyukhin, V. A. Shishkin
Some methods of hash functions analysis with application to the GOST P 34.11-94 algorithm
Mat. Vopr. Kriptogr., 2012, 3:4, 71–89
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2019, 10:1, 27–40
|
Yu. I. Medvedev, see A. M. Zubkov
Mat. Vopr. Kriptogr., 2020, 11:1, 27–46
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2015, 6:1, 33–56
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2024, 15:1, 35–55
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2023, 14:1, 45–63
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2018, 9:1, 47–64
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2016, 7:1, 57–70
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2013, 4:1, 59–76
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2011, 2:2, 41–53
|
Yu. I. Medvedev, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2012, 3:3, 21–34
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2017, 8:3, 41–56
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2024, 15:3, 49–66
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2022, 13:3, 77–92
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2022, 13:4, 37–51
|
Yu. I. Medvedev, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2013, 4:4, 49–63
|
Yu. I. Medvedev, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
A. V. Menyachikhin
The change in linear and differential characteristics of substitution after the multiplication by transposition
Mat. Vopr. Kriptogr., 2020, 11:2, 111–123
|
A. V. Menyachikhin
Spectral-linear and spectral-differential methods for generating S-boxes having almost optimal cryptographic parameters
Mat. Vopr. Kriptogr., 2017, 8:2, 97–116
|
N. M. Mezhennaya, V. G. Mikhailov
On the asymptotic normality of frequencies of values in the non-equiprobable multi-cyclic random sequence modulo 4
Mat. Vopr. Kriptogr., 2016, 7:4, 81–94
|
N. M. Mezhennaya, V. G. Mikhailov
On the distribution of the number of ones in the output sequence of the MCV-generator over $GF(2)$
Mat. Vopr. Kriptogr., 2013, 4:4, 95–107
|
A. R. Miftakhutdinova, see V. M. Fomichev
Mat. Vopr. Kriptogr., 2019, 10:2, 181–191
|
V. G. Mikhailov, see V. A. Kopyttsev
Mat. Vopr. Kriptogr., 2015, 6:1, 57–79
|
V. G. Mikhailov, see V. A. Kopyttsev
Mat. Vopr. Kriptogr., 2014, 5:1, 73–83
|
V. G. Mikhailov
Controlled multinomial allocation scheme
Mat. Vopr. Kriptogr., 2018, 9:1, 75–88
|
V. G. Mihailov, A. M. Shoitov
On the numbers of equivalent tuples sets in a sequence of independent random variables
Mat. Vopr. Kriptogr., 2013, 4:1, 77–86
|
V. G. Mikhailov
The number of decomposition of random permutation into the product
of two involutions with given cycle in one of multipliers
Mat. Vopr. Kriptogr., 2017, 8:1, 80–94
|
V. G. Mikhailov, V. I. Kruglov
Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests
Mat. Vopr. Kriptogr., 2023, 14:1, 85–97
|
V. G. Mikhailov, see V. A. Kopyttsev
Mat. Vopr. Kriptogr., 2011, 2:2, 55–80
|
V. G. Mikhailov, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
V. G. Mikhailov, A. M. Shoitov
On multiple repetitions of long tuples in a Markov chain
Mat. Vopr. Kriptogr., 2015, 6:3, 117–133
|
V. G. Mikhailov
On the limit behaviour of the number of solutions for compatible systems of equations with random selection of unknowns
Mat. Vopr. Kriptogr., 2010, 1:3, 27–43
|
V. G. Mikhailov, see V. A. Kopyttsev
Mat. Vopr. Kriptogr., 2012, 3:3, 35–55
|
V. G. Mikhailov, see V. I. Kruglov
Mat. Vopr. Kriptogr., 2020, 11:3, 41–52
|
V. G. Mikhailov, A. V. Volgin
The stability of sets of solutions for systems of equations with random distortions
Mat. Vopr. Kriptogr., 2016, 7:3, 61–72
|
V. G. Mikhailov, V. I. Kruglov
Two variants of Lempel – Ziv test for binary sequences
Mat. Vopr. Kriptogr., 2022, 13:3, 93–106
|
V. G. Mikhailov, see V. O. Mironkin
Mat. Vopr. Kriptogr., 2018, 9:3, 99–108
|
V. G. Mikhailov, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
V. G. Mikhailov, V. I. Kruglov
On the asymptotic normality in the problem on the tuples repetitions in a marked complete tree
Mat. Vopr. Kriptogr., 2021, 12:4, 59–64
|
V. G. Mikhailov
Poisson approximation for the distribution of the frequency of a given pattern in the outcome sequence of the MCV-generator
Mat. Vopr. Kriptogr., 2014, 5:4, 63–71
|
V. G. Mikhailov, see V. A. Kopyttsev
Mat. Vopr. Kriptogr., 2010, 1:4, 63–84
|
V. G. Mikhailov, see V. I. Kruglov
Mat. Vopr. Kriptogr., 2019, 10:4, 67–76
|
V. G. Mikhailov, see N. M. Mezhennaya
Mat. Vopr. Kriptogr., 2016, 7:4, 81–94
|
V. G. Mikhailov, see N. M. Mezhennaya
Mat. Vopr. Kriptogr., 2013, 4:4, 95–107
|
A. V. Mikhalev, A. A. Nechaev
Cyclic types of families of polylinear recurrent sequences and generators of pseudorandom numbers
Mat. Vopr. Kriptogr., 2014, 5:1, 95–125
|
A. V. Mikhalev, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
A. V. Mikhalev, see A. V. Gribov
Mat. Vopr. Kriptogr., 2010, 1:4, 23–32
|
A. V. Mikhalev, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
A. A. Minakov
Poisson approximation for the number of non-decreasing runs in Markov chains
Mat. Vopr. Kriptogr., 2018, 9:2, 103–116
|
V. O. Mironkin
Layers in a graph of the composition of independent uniform random mappings
Mat. Vopr. Kriptogr., 2020, 11:1, 101–114
|
V. O. Mironkin
Layers of the graph of $k$-fold iteration of the uniform random mapping
Mat. Vopr. Kriptogr., 2019, 10:1, 73–82
|
V. O. Mironkin, see D. S. Bogdanov
Mat. Vopr. Kriptogr., 2019, 10:2, 61–74
|
V. O. Mironkin
Distribution of the length of aperiodicity segment in the graph of independent uniform random mappings composition
Mat. Vopr. Kriptogr., 2019, 10:3, 89–99
|
V. O. Mironkin, V. G. Mikhailov
On the sets of images of $k$-fold iteration of uniform random mapping
Mat. Vopr. Kriptogr., 2018, 9:3, 99–108
|
V. O. Mironkin, see A. M. Zubkov
Mat. Vopr. Kriptogr., 2017, 8:4, 63–74
|
V. A. Mironova, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2015, 6:1, 33–56
|
V. A. Mironova, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2016, 7:1, 57–70
|
V. A. Mironova, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2013, 4:1, 59–76
|
V. A. Mironova, see G. I. Ivchenko
Mat. Vopr. Kriptogr., 2013, 4:4, 49–63
|
V. V. Mizerov, see O. V. Kamlovskii
Mat. Vopr. Kriptogr., 2024, 15:3, 67–82
|
V. V. Mizerov, see O. V. Kamlovskii
Mat. Vopr. Kriptogr., 2020, 11:4, 23–47
|
V. V. Mizerov, see A. R. Vasin
Mat. Vopr. Kriptogr., 2021, 12:4, 25–41
|
V. V. Mizerov, see O. V. Kamlovskii
Mat. Vopr. Kriptogr., 2022, 13:4, 53–67
|
V. V. Mizerov, see O. V. Kamlovskii
Mat. Vopr. Kriptogr., 2023, 14:4, 71–88
|
A. Moch, see M. Hamann
Mat. Vopr. Kriptogr., 2020, 11:2, 137–151
|
S. N. Molotkov, see I. M. Arbekov
Mat. Vopr. Kriptogr., 2023, 14:3, 9–33
|
N. Mouha, see G. Sekar
Mat. Vopr. Kriptogr., 2014, 5:2, 117–125
|
Z. Naghdabadi, see S. Karimani
Mat. Vopr. Kriptogr., 2019, 10:2, 97–106
|
A. A. Nechaev, see A. V. Mikhalev
Mat. Vopr. Kriptogr., 2014, 5:1, 95–125
|
A. A. Nechaev, see A. S. Kuz'min
Mat. Vopr. Kriptogr., 2010, 1:2, 31–56
|
A. A. Nechaev, see M. A. Goltvanitsa
Mat. Vopr. Kriptogr., 2013, 4:2, 59–72
|
A. A. Nechaev, A. V. Abornev
Nonlinear permutations of a space over a finite field induced by linear transformations of a module over a Galois ring
Mat. Vopr. Kriptogr., 2013, 4:2, 81–100
|
A. A. Nechaev, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
A. Yu. Nesterenko
On an approach to the expansion of irrational numbers
Mat. Vopr. Kriptogr., 2018, 9:1, 89–106
|
A. Yu. Nesterenko
On an approach to the construction of secure connections
Mat. Vopr. Kriptogr., 2013, 4:2, 101–111
|
A. Yu. Nesterenko
Some remarks on the elliptic curve discrete logarithm problem
Mat. Vopr. Kriptogr., 2016, 7:2, 115–120
|
A. Yu. Nesterenko
A new authenticated encryption mode for arbitrary block
cipher based on universal hash function
Mat. Vopr. Kriptogr., 2017, 8:2, 117–130
|
A. Yu. Nesterenko
Construction of strong elliptic curves suitable for cryptographic applications
Mat. Vopr. Kriptogr., 2019, 10:2, 135–144
|
A. Yu. Nesterenko
Constructions of elliptic curves endomorphisms
Mat. Vopr. Kriptogr., 2014, 5:2, 99–102
|
A. Yu. Nesterenko
On a family of universal hash functions
Mat. Vopr. Kriptogr., 2015, 6:3, 135–151
|
Yu. V. Nesterenko, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
L. O. Nikiforova, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2024, 15:2, 7–28
|
L. O. Nikiforova, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2022, 13:3, 5–35
|
M. V. Nikitenkova, see D. V. Denisenko
Mat. Vopr. Kriptogr., 2020, 11:2, 43–52
|
M. V. Nikolaev
Modified Gaudry–Schost algorithm for the two-dimensional discrete logarithm problem
Mat. Vopr. Kriptogr., 2020, 11:2, 125–135
|
M. V. Nikolaev
On the complexity of two-dimensional discrete logarithm problem in a finite cyclic group with efficient automorphism
Mat. Vopr. Kriptogr., 2015, 6:2, 45–57
|
V. D. Nikolaev
Attacks on digital signature schemes not accounted by the common security definitions, and countermeasures
Mat. Vopr. Kriptogr., 2016, 7:1, 93–118
|
V. D. Nikolaev, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2018, 9:3, 5–32
|
N. V. Nikonov
Polyhedral classes of $k$-valued logic functions with generalized filter taboo and semitaboo
Mat. Vopr. Kriptogr., 2012, 3:1, 53–69
|
V. G. Nikonov
On the structure of strictly convex $k$-functions
Mat. Vopr. Kriptogr., 2011, 2:1, 75–95
|
V. G. Nikonov, see M. V. Zaets
Mat. Vopr. Kriptogr., 2013, 4:3, 21–47
|
V. G. Nikonov, A. V. Sarantsev
On the conplexity of joint realization of Boolean functions regular systems in the DNF basis
Mat. Vopr. Kriptogr., 2010, 1:3, 45–65
|
V. G. Nikonov
On the number of significant variables of balanced Boolean function with the fixed number of elementary conjunctions in its DNF
Mat. Vopr. Kriptogr., 2011, 2:4, 37–47
|
V. A. Nosov, see A. V. Galatenko
Mat. Vopr. Kriptogr., 2023, 14:2, 43–58
|
S. A. Novoselov, see E. S. Malygina
Mat. Vopr. Kriptogr., 2020, 11:2, 69–81
|
V. I. Nozdrunov, see D. S. Bogdanov
Mat. Vopr. Kriptogr., 2022, 13:3, 37–44
|
V. I. Nozdrunov, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2023, 14:3, 49–73
|
R. V. Oleynykov, see O. V. Kazymyrov
Mat. Vopr. Kriptogr., 2014, 5:2, 71–78
|
I. B. Oshkin, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2016, 7:1, 5–38
|
I. B. Oshkin, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2017, 8:2, 39–50
|
I. B. Oshkin, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2016, 7:4, 7–28
|
A. V. Urivskiy
Random number generators based on permutations can pass the collision test
Mat. Vopr. Kriptogr., 2021, 12:1, 97–108
|
K. N. Pankov
Local limit theorem for the distribution of incomplete vector formed by the weights of subfunctions of random binary mapping components
Mat. Vopr. Kriptogr., 2014, 5:3, 49–80
|
K. N. Pankov
Asymptotic estimates for numbers of Boolean mappings with given cryptographic properties
Mat. Vopr. Kriptogr., 2014, 5:4, 73–97
|
A. E. Pankratiev, see A. V. Galatenko
Mat. Vopr. Kriptogr., 2023, 14:2, 43–58
|
D. Pasko, see V. G. Antipkin
Mat. Vopr. Kriptogr., 2021, 12:2, 39–55
|
A. A. Peñate, P. F. Arrozarena
Extending AES improvements: A proposal for Alpha-MAC in view of collision resistance
Mat. Vopr. Kriptogr., 2022, 13:2, 117–131
|
A. A. Peñate, see R. R. Aulet
Mat. Vopr. Kriptogr., 2023, 14:3, 35–47
|
Trieu Quang Phong
Considering two MAC under SIG variants of the basic SIGMA protocol
Mat. Vopr. Kriptogr., 2019, 10:2, 145–158
|
T. Q. Phong, N. Q. Toan, K. X. Thanh
A security proof for key exchange protocols
Mat. Vopr. Kriptogr., 2016, 7:4, 117–132
|
A. B. Pichkur
Description of the set of permutations representable as a product of two permutations with fixed number of mobile points. II
Mat. Vopr. Kriptogr., 2013, 4:1, 87–109
|
A. B. Pichkur
Description of the set of permutations represented as a product of two permutations with fixed number of mobile points
Mat. Vopr. Kriptogr., 2012, 3:2, 79–95
|
A. B. Pichkur, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
D. V. Pil'shchikov
On the mean value of the total length of chains computed during the additional checkings in the tradeoff method with distinguished points
Mat. Vopr. Kriptogr., 2022, 13:1, 101–136
|
D. V. Pil'shchikov
On a probabilistic approach to the estimation of reliability of the Hellman method
Mat. Vopr. Kriptogr., 2019, 10:1, 83–114
|
D. V. Pilshchikov
Asymptotic behaviour of the complete preimage cardinality for the image of a random set under iterations of mappings of a finite set
Mat. Vopr. Kriptogr., 2017, 8:1, 95–106
|
D. V. Pilshchikov
Estimation of the characteristics of time-memory-data tradeoff methods via generating functions of the number of particles and the total number of particles in the Galton–Watson process
Mat. Vopr. Kriptogr., 2014, 5:2, 103–108
|
D. V. Pilshchikov
On the limiting mean values in probabilistic models of time-memory-data tradeoff methods
Mat. Vopr. Kriptogr., 2015, 6:2, 59–65
|
D. V. Pilshchikov
A complexity analysis of algorithm of parallel search of the “gold” collision
Mat. Vopr. Kriptogr., 2015, 6:4, 77–97
|
D. V. Pilshchikov
Complexity analysis of the method of rainbow tables with fingerprints
Mat. Vopr. Kriptogr., 2017, 8:4, 99–116
|
B. A. Pogorelov, M. A. Pudovkina
Partitions on bigrams and Markov property of block ciphers
Mat. Vopr. Kriptogr., 2017, 8:1, 107–142
|
B. A. Pogorelov, M. A. Pudovkina
$\otimes_{\mathbf{W}}$-markovianity of XSL-block ciphers connected with properties of their round functions
Mat. Vopr. Kriptogr., 2019, 10:1, 115–142
|
B. A. Pogorelov, M. A. Pudovkina
Orbital derivatives on the residue ring. Part II. Probabilistic and combinatorial properties
Mat. Vopr. Kriptogr., 2015, 6:1, 117–133
|
B. A. Pogorelov, M. A. Pudovkina
Properties of graphs of orbitals for overgroups of the Jevons group
Mat. Vopr. Kriptogr., 2010, 1:1, 55–83
|
B. A. Pogorelov, M. A. Pudovkina
Natural metrics and their properties. P. 2. Hamming-type metrics
Mat. Vopr. Kriptogr., 2012, 3:1, 71–95
|
B. A. Pogorelov, see D. A. Burov
Mat. Vopr. Kriptogr., 2016, 7:2, 35–46
|
B. A. Pogorelov, see D. A. Burov
Mat. Vopr. Kriptogr., 2018, 9:2, 47–58
|
B. A. Pogorelov, see D. A. Burov
Mat. Vopr. Kriptogr., 2017, 8:2, 51–64
|
B. A. Pogorelov, M. A. Pudovkina
The simplest overgroups of regular permutation representations of nonabelian $2$-groups with a cyclic subgroup of index $2$
Mat. Vopr. Kriptogr., 2022, 13:3, 107–130
|
B. A. Pogorelov, M. A. Pudovkina
Permutation homomorphisms of block ciphers and ${\otimes _{\mathbf{W}}}$-Markovian property
Mat. Vopr. Kriptogr., 2018, 9:3, 109–126
|
B. A. Pogorelov, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
B. A. Pogorelov, M. A. Pudovkina
On group properties of classes Source-Heavy and Target-Heavy Feistel block ciphers with round functions linear dependent on round keys parts
Mat. Vopr. Kriptogr., 2023, 14:3, 127–155
|
B. A. Pogorelov, M. A. Pudovkina
Factor structures of transformations
Mat. Vopr. Kriptogr., 2012, 3:3, 81–104
|
B. A. Pogorelov, M. A. Pudovkina
Combinatorial characterization of XL-layers
Mat. Vopr. Kriptogr., 2013, 4:3, 99–129
|
B. A. Pogorelov, M. A. Pudovkina
Nonabelian key addition groups and $\otimes _{\mathbf{W}}$-markovian property of block ciphers
Mat. Vopr. Kriptogr., 2020, 11:4, 107–131
|
B. A. Pogorelov, M. A. Pudovkina
Multipermutations on the Cartesian product of groups and their properties
Mat. Vopr. Kriptogr., 2023, 14:4, 111–142
|
B. A. Pogorelov, M. A. Pudovkina
Natural metrics and their properties. P. 1. Submetrics and overmetrics
Mat. Vopr. Kriptogr., 2011, 2:4, 49–74
|
B. A. Pogorelov, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
B. A. Pogorelov, M. A. Pudovkina
Properties of permutation representations of nonabelian $2$-groups with a cyclic subgroup of index $2$
Mat. Vopr. Kriptogr., 2021, 12:4, 65–85
|
B. A. Pogorelov, M. A. Pudovkina
Characterization of mappings by the nonisometricity property
Mat. Vopr. Kriptogr., 2019, 10:4, 77–116
|
B. A. Pogorelov, M. A. Pudovkina
Generalized quasi-Hadamard transformations on finite groups
Mat. Vopr. Kriptogr., 2022, 13:4, 97–124
|
B. A. Pogorelov, M. A. Pudovkina
Orbital derivatives on residue rings. Part I. General properties
Mat. Vopr. Kriptogr., 2014, 5:4, 99–127
|
S. V. Polikarpov, see A. A. Kozhevnikov
Mat. Vopr. Kriptogr., 2016, 7:2, 91–102
|
S. V. Polin
Permutation lattices of equivalence relations on the Cartesian products and systems of equations concordant with these lattices. I
Mat. Vopr. Kriptogr., 2015, 6:1, 135–158
|
S. V. Polin
Solution of equations by the sequential grouping method and its optimization
Mat. Vopr. Kriptogr., 2012, 3:1, 97–123
|
S. V. Polin
Permutation lattices of equivalence relations on Cartesian products
Mat. Vopr. Kriptogr., 2014, 5:3, 81–116
|
S. V. Polin
Permutation lattices of equivalence relations on the Cartesian products and systems of equations concordant with these lattices. II
Mat. Vopr. Kriptogr., 2017, 8:3, 85–108
|
S. V. Polin
Systems of equations and lattices of congruences of universal algebras
Mat. Vopr. Kriptogr., 2013, 4:4, 109–144
|
S. V. Polin
Certainly solvable equations on algebraic systems
Mat. Vopr. Kriptogr., 2012, 3:4, 91–125
|
V. O. Popov, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2016, 7:1, 5–38
|
V. O. Popov, S. V. Smyshlyaev
Construction of RNG using random automata and “one-way” functions
Mat. Vopr. Kriptogr., 2014, 5:2, 109–115
|
V. O. Popov, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2015, 6:2, 7–17
|
S. V. Poruchnik, see S. V. Agievich
Mat. Vopr. Kriptogr., 2022, 13:2, 17–35
|
B. Preneel, see G. Sekar
Mat. Vopr. Kriptogr., 2014, 5:2, 117–125
|
A. S. Prokhorov, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2015, 6:2, 7–17
|
Yu. V. Prokhorov, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2017, 8:1, 107–142
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2019, 10:1, 115–142
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2015, 6:1, 117–133
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2010, 1:1, 55–83
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2012, 3:1, 71–95
|
M. A. Pudovkina, G. I. Khoruzenko
On classes of weak keys of generalized cryptosystem PRINT
Mat. Vopr. Kriptogr., 2013, 4:2, 113–125
|
M. A. Pudovkina, G. I. Khoruzenko
An attack on the GOST 28147-89 block cipher with 12 related keys
Mat. Vopr. Kriptogr., 2013, 4:2, 127–152
|
M. A. Pudovkina, see V. V. Vlasova
Mat. Vopr. Kriptogr., 2018, 9:2, 59–70
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2022, 13:3, 107–130
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2018, 9:3, 109–126
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2023, 14:3, 127–155
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2012, 3:3, 81–104
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2013, 4:3, 99–129
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2020, 11:4, 107–131
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2023, 14:4, 111–142
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2011, 2:4, 49–74
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2021, 12:4, 65–85
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2019, 10:4, 77–116
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2022, 13:4, 97–124
|
M. A. Pudovkina, see B. A. Pogorelov
Mat. Vopr. Kriptogr., 2014, 5:4, 99–127
|
O. C. Puente, R. F. Leal, R. A. de la Cruz Jiménez
On the Bit-Slice representations of some nonlinear bijective transformations
Mat. Vopr. Kriptogr., 2024, 15:1, 97–125
|
O. C. Puente, R. A. de la Cruz Jiménez
Construction of orthomorphic $\mathrm{MDS}$ matrices with primitive characteristic polynomial
Mat. Vopr. Kriptogr., 2021, 12:4, 125–143
|
I. V. Radchenko, see K. S. Kravtsov
Mat. Vopr. Kriptogr., 2016, 7:2, 111–114
|
P. V. Roldugin, A. V. Tarasov
On the Boolean functions without upper bijunctive analogues
Mat. Vopr. Kriptogr., 2013, 4:1, 111–128
|
P. V. Roldugin
Graph reduction in the construction of minimal clique cover
Mat. Vopr. Kriptogr., 2012, 3:3, 105–128
|
P. V. Roldugin
On a method for constructing low-weight Boolean functions without majorants of the given number of variables
Mat. Vopr. Kriptogr., 2016, 7:3, 73–92
|
V. I. Rudskoi, see D. M. Dygin
Mat. Vopr. Kriptogr., 2015, 6:2, 29–34
|
V. I. Rudskoi, see G. B. Marshalko
Mat. Vopr. Kriptogr., 2020, 11:2, 99–110
|
K. E. Rumyantsev, see A. A. Kozhevnikov
Mat. Vopr. Kriptogr., 2016, 7:2, 91–102
|
V. G. Ryabov
Distance between vectorial Boolean functions and affine analogues (following the Eighth International Olympiad in Cryptography)
Mat. Vopr. Kriptogr., 2024, 15:1, 127–142
|
V. G. Ryabov
Characteristics of nonlinearity of vectorial functions over finite fields
Mat. Vopr. Kriptogr., 2023, 14:2, 123–136
|
V. G. Ryabov
On the question on the approximation of vectorial functions over finite fields by affine analogues
Mat. Vopr. Kriptogr., 2022, 13:4, 125–146
|
V. G. Ryabov
Nonlinearity of bent functions over finite fields
Mat. Vopr. Kriptogr., 2021, 12:4, 87–98
|
A. S. Rybakov
Estimates of the number of integers with the special prime factorization
Mat. Vopr. Kriptogr., 2016, 7:1, 119–142
|
A. S. Rybakov
A modification of an algorithm for estimating the cardinality of integers with no more than three prime divisors
Mat. Vopr. Kriptogr., 2013, 4:3, 131–158
|
A. S. Rybakov
Estimates of the number of integers with the special prime factorization. II
Mat. Vopr. Kriptogr., 2020, 11:3, 53–78
|
A. S. Rybkin
On software implementation of Kuznyechik on Intel CPUs
Mat. Vopr. Kriptogr., 2018, 9:2, 117–127
|
M.-J. O. Saarinen
StriBob: authenticated encryption from GOST R 34.11-2012 LPS permutation
Mat. Vopr. Kriptogr., 2015, 6:2, 67–78
|
V. N. Sachkov
Random mappings of sets with restrictions on parameters. I
Mat. Vopr. Kriptogr., 2012, 3:1, 125–144
|
V. N. Sachkov
Difference specification of substitutions and partitions in a residue ring
Mat. Vopr. Kriptogr., 2014, 5:1, 127–150
|
V. N. Sachkov
Combinatorial properties of differentially $2$-uniform substitutions
Mat. Vopr. Kriptogr., 2015, 6:1, 159–179
|
V. N. Sachkov
Cycle structure of the elements of centralizers of permutations from the symmetric group
Mat. Vopr. Kriptogr., 2010, 1:1, 85–100
|
V. N. Sachkov
The establishment and development of modern domestic cryptography
Mat. Vopr. Kriptogr., 2022, 13:2, 7–15
|
V. N. Sachkov
Random mappings with fixed elements
Mat. Vopr. Kriptogr., 2011, 2:2, 95–118
|
V. N. Sachkov
Random mappings of sets with restrictions on parameters. II
Mat. Vopr. Kriptogr., 2012, 3:2, 97–116
|
V. N. Sachkov, I. A. Kruglov
Variance of the additive weight deficit of equiprobable involution on the residue group
Mat. Vopr. Kriptogr., 2019, 10:3, 101–116
|
V. N. Sachkov, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
V. N. Sachkov
Random substitutions with cycles of bounded lengths and transforming
Mat. Vopr. Kriptogr., 2014, 5:3, 117–136
|
V. N. Sachkov, I. A. Kruglov
Moments of the weight deficit of a random equiprobable involution acting on a vector space over a field of two elements
Mat. Vopr. Kriptogr., 2018, 9:4, 101–124
|
V. N. Sachkov
Involutions with given weight deficit corresponding to the Cayley table of the finite Abelian group
Mat. Vopr. Kriptogr., 2017, 8:4, 117–134
|
V. N. Sachkov
Random substitutions with transformed cycles
Mat. Vopr. Kriptogr., 2012, 3:4, 127–150
|
V. N. Sachkov, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
V. N. Sachkov, I. A. Kruglov
Weight deficits of involutions and substitutions
Mat. Vopr. Kriptogr., 2016, 7:4, 95–116
|
A. V. Sarantsev
Properties of substitutions generated by a class of filtering generators
Mat. Vopr. Kriptogr., 2023, 14:1, 99–114
|
A. V. Sarantsev
Description of the feedback function of a nonlinear shift register
Mat. Vopr. Kriptogr., 2024, 15:3, 101–112
|
A. V. Sarantsev, see V. G. Nikonov
Mat. Vopr. Kriptogr., 2010, 1:3, 45–65
|
G. K. Sedov, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2019, 10:2, 31–46
|
G. K. Sedov, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2019, 10:2, 47–60
|
G. K. Sedov
The security of GOST R 34.11-2012 against preimage and collision attacks
Mat. Vopr. Kriptogr., 2015, 6:2, 79–98
|
G. Sekar, N. Mouha, B. Preneel
Meet-in-the-middle attacks on reduced-round GOST
Mat. Vopr. Kriptogr., 2014, 5:2, 117–125
|
A. M. Semenov
Analysis of Russian key-agreement protocols using automated verification tools
Mat. Vopr. Kriptogr., 2017, 8:2, 131–142
|
V. I. Semenov, see S. V. Agievich
Mat. Vopr. Kriptogr., 2022, 13:2, 17–35
|
V. I. Semenov, see S. V. Agievich
Mat. Vopr. Kriptogr., 2017, 8:2, 7–28
|
A. A. Serov, see A. M. Zubkov
Mat. Vopr. Kriptogr., 2021, 12:1, 131–142
|
A. A. Serov, see A. M. Zubkov
Mat. Vopr. Kriptogr., 2023, 14:2, 137–145
|
A. A. Serov
Estimates of the neighborhood volumes of binary codes via their weight spectra
Mat. Vopr. Kriptogr., 2013, 4:2, 17–42
|
A. A. Serov, see A. M. Zubkov
Mat. Vopr. Kriptogr., 2019, 10:2, 89–96
|
V. A. Serov, see O. D. Avraamova
Mat. Vopr. Kriptogr., 2021, 12:2, 21–38
|
I. G. Shaposhnikov
Congruences of finite multi-base universal algebras isomorphic to $n$-ary groups derived from groups
Mat. Vopr. Kriptogr., 2022, 13:3, 131–142
|
I. G. Shaposhnikov, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
A. V. Shapovalov
Properties of random systems of discrete equations with nonuniform sampling of unknowns
Mat. Vopr. Kriptogr., 2010, 1:3, 93–117
|
A. V. Shapovalov
Satisfiability of random systems of equations with nonuniform sampling of two-valued unknowns
Mat. Vopr. Kriptogr., 2011, 2:4, 109–146
|
V. A. Shishkin, see I. V. Lavrikov
Mat. Vopr. Kriptogr., 2019, 10:2, 125–134
|
V. A. Shishkin, see D. M. Dygin
Mat. Vopr. Kriptogr., 2015, 6:2, 29–34
|
V. A. Shishkin, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
V. A. Shishkin, see D. V. Matyukhin
Mat. Vopr. Kriptogr., 2012, 3:4, 71–89
|
A. B. Shishkov, see M. V. Zaets
Mat. Vopr. Kriptogr., 2013, 4:3, 21–47
|
A. B. Shishkov
On bent-functions on the group $\mathbb Z_{p^n}$
Mat. Vopr. Kriptogr., 2015, 6:4, 127–138
|
Yu. D. Shkuratov, see S. A. Davydov
Mat. Vopr. Kriptogr., 2024, 15:2, 29–46
|
A. M. Shoitov, see V. G. Mikhailov
Mat. Vopr. Kriptogr., 2013, 4:1, 77–86
|
A. M. Shoitov, see V. G. Mikhailov
Mat. Vopr. Kriptogr., 2015, 6:3, 117–133
|
A. M. Shoitov
Structurally equivalent tuples in the equiprobable polynomial scheme
Mat. Vopr. Kriptogr., 2012, 3:3, 129–151
|
A. M. Shoitov, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
V. N. Shokov, see O. D. Avraamova
Mat. Vopr. Kriptogr., 2021, 12:2, 21–38
|
M. S. Shupletsov, see S. A. Lozhkin
Mat. Vopr. Kriptogr., 2017, 8:2, 87–96
|
D. V. Shuvaev
Computing the distribution of a combinatorial statistics defined on permutations of a given multiset
Mat. Vopr. Kriptogr., 2011, 2:3, 99–109
|
D. V. Shuvaev
On subsequences of Markov sequences
Mat. Vopr. Kriptogr., 2016, 7:4, 133–142
|
A. V. Smirnov, see O. D. Avraamova
Mat. Vopr. Kriptogr., 2021, 12:2, 21–38
|
V. G. Smirnov
Methods of solution of discrete equations systems over the ring of integers based on the construction of graphs of solutions
Mat. Vopr. Kriptogr., 2018, 9:1, 107–126
|
V. G. Smirnov
Layers of a finite automaton
Mat. Vopr. Kriptogr., 2011, 2:1, 97–117
|
V. G. Smirnov
Methods of solution of systems of quasisymmetric equations with applications to the analysis of clock-controlled generators
Mat. Vopr. Kriptogr., 2010, 1:3, 67–91
|
V. G. Smirnov
Discrete functions and sparse systems of discrete equations
Mat. Vopr. Kriptogr., 2016, 7:3, 93–114
|
V. G. Smirnov
Layers and cyclic factors of finite semigroups
Mat. Vopr. Kriptogr., 2011, 2:4, 75–95
|
S. V. Smyshlyaev, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2016, 7:1, 5–38
|
S. V. Smyshlyaev, see V. O. Popov
Mat. Vopr. Kriptogr., 2014, 5:2, 109–115
|
S. V. Smyshlyaev
On the invariance of perfect balancedness property under the choice of tapping sequence
Mat. Vopr. Kriptogr., 2014, 5:2, 127–135
|
S. V. Smyshlyaev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2018, 9:2, 23–46
|
S. V. Smyshlyaev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2023, 14:2, 25–42
|
S. V. Smyshlyaev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2019, 10:2, 31–46
|
S. V. Smyshlyaev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2017, 8:2, 39–50
|
S. V. Smyshlyaev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2023, 14:2, 7–24
|
S. V. Smyshlyaev, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2024, 15:2, 7–28
|
S. V. Smyshlyaev, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2015, 6:2, 7–17
|
S. V. Smyshlyaev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2021, 12:2, 75–91
|
S. V. Smyshlyaev, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2022, 13:3, 5–35
|
S. V. Smyshlyaev, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2018, 9:3, 5–32
|
S. V. Smyshlyaev, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2021, 12:3, 5–30
|
S. V. Smyshlyaev, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2021, 12:4, 5–23
|
S. V. Smyshlyaev, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2016, 7:4, 7–28
|
E. S. Smyshlyaeva, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2019, 10:2, 31–46
|
V. I. Solodovnikov
Three approaches to the notion of functions maximally differing from homomorphisms
Mat. Vopr. Kriptogr., 2016, 7:3, 115–136
|
V. I. Solodovnikov
On primary functions which are minimally close to linear functions
Mat. Vopr. Kriptogr., 2011, 2:4, 97–108
|
L. A. Sonina, see L. R. Akhmetzyanova
Mat. Vopr. Kriptogr., 2017, 8:2, 39–50
|
L. A. Sonina, see E. K. Alekseev
Mat. Vopr. Kriptogr., 2015, 6:2, 7–17
|
V. S. Starostin, see V. I. Korzhik
Mat. Vopr. Kriptogr., 2021, 12:3, 125–141
|
M. A. Suleymanov, see O. A. Kozlitin
Mat. Vopr. Kriptogr., 2023, 14:4, 89–110
|
V. E. Tarakanov
On the convergence of iterations for a method of solution of discrete logarithm representation problem by means of rational approximations
Mat. Vopr. Kriptogr., 2010, 1:4, 111–125
|
A. V. Tarasov, see P. V. Roldugin
Mat. Vopr. Kriptogr., 2013, 4:1, 111–128
|
A. V. Tarasov
On a method to construct special type corollaries for systems of Boolean equations
Mat. Vopr. Kriptogr., 2023, 14:1, 115–130
|
A. V. Tarasov, see S. P. Gorshkov
Mat. Vopr. Kriptogr., 2018, 9:1, 5–26
|
A. V. Tarasov, see V. S. Litvinenko
Mat. Vopr. Kriptogr., 2015, 6:1, 81–107
|
A. V. Tarasov
Bijunctive Boolean functions, graphs of 2-CNF and their order functions. Estimates of weight of a bijunctive function with a given number of layers
Mat. Vopr. Kriptogr., 2021, 12:1, 83–95
|
A. V. Tarasov
Properties of generator systems of universal algebras generated by Boolean bijunctive functions
Mat. Vopr. Kriptogr., 2012, 3:2, 117–130
|
A. V. Tarasov
Universal algebras generated by sets of satisfying vectors of bijunctive and $r$-junctive Boolean functions
Mat. Vopr. Kriptogr., 2011, 2:3, 75–98
|
A. V. Tarasov
Parameters of the maximum likelihood method applied to the solution of systems of twice bijunctive equations with corrupted right-hand sides
Mat. Vopr. Kriptogr., 2020, 11:3, 79–100
|
A. V. Tarasov
Two methods of estimation of Boolean bijunctive function weights
Mat. Vopr. Kriptogr., 2018, 9:4, 125–142
|
A. V. Tarasov
The stabilizers of certain families of Boolean functions of $n$ variables that form a Galois-closed subalgebra of the Schaefer algebra. II
Mat. Vopr. Kriptogr., 2017, 8:4, 135–156
|
A. V. Tarasov, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
A. V. Tarasov
Stabilizers of some families of Boolean functions constituting Galois-closed subalgebras of the Schaefer algebra
Mat. Vopr. Kriptogr., 2015, 6:4, 99–125
|
K. X. Thanh, see Trieu Quang Phong
Mat. Vopr. Kriptogr., 2016, 7:4, 117–132
|
M. I. Tikhomirova, V. P. Chistyakov
The statistical test of the empty cells type
Mat. Vopr. Kriptogr., 2010, 1:1, 101–108
|
M. I. Tihomirova, V. P. Chistyakov
Asymptotic normality of the number of non-appeared values in random $m$-dependent sequences
Mat. Vopr. Kriptogr., 2011, 2:1, 119–129
|
A. N. Timashev
On an additive problem of number theory with random number of summands
Mat. Vopr. Kriptogr., 2013, 4:1, 129–150
|
N. Q. Toan, see Trieu Quang Phong
Mat. Vopr. Kriptogr., 2016, 7:4, 117–132
|
D. I. Trifonov, see D. M. Dygin
Mat. Vopr. Kriptogr., 2015, 6:2, 29–34
|
D. I. Trifonov, see F. M. Malyshev
Mat. Vopr. Kriptogr., 2016, 7:3, 47–60
|
A. E. Trishin, see F. M. Malyshev
Mat. Vopr. Kriptogr., 2020, 11:2, 83–98
|
A. E. Trishin, see A. V. Erokhin
Mat. Vopr. Kriptogr., 2017, 8:4, 29–62
|
K. D. Tsaregorodtsev
Privacy and integrity properties of $\mathrm{ECIES}$ scheme
Mat. Vopr. Kriptogr., 2024, 15:2, 101–136
|
K. D. Tsaregorodtsev
Format-preserving encryption: a survey
Mat. Vopr. Kriptogr., 2022, 13:2, 133–153
|
K. D. Tsaregorodtsev, see A. V. Galatenko
Mat. Vopr. Kriptogr., 2023, 14:2, 43–58
|
K. D. Tsaregorodtsev
Alternative security models for a pseudorandom function
Mat. Vopr. Kriptogr., 2024, 15:3, 113–134
|
V. N. Tsypyshev
Lower estimates of ranks of coordinate sequences of maximal period linear recurrent sequences over the non-trivial Galois ring
Mat. Vopr. Kriptogr., 2016, 7:3, 137–143
|
O. Yu. Turchenko, see Yu. V. Kosolapov
Mat. Vopr. Kriptogr., 2021, 12:2, 111–128
|
O. N. Vasilenko
Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
Mat. Vopr. Kriptogr., 2011, 2:1, 5–28
|
O. N. Vasilenko
On, algorithmic constructions of isogenies of elliptic curves over finite fields and their applications
Mat. Vopr. Kriptogr., 2010, 1:1, 7–22
|
A. V. Vasiliev, M. T. Ziatdinov
Minimizing collisions for quantum hashing
Mat. Vopr. Kriptogr., 2016, 7:2, 47–52
|
A. R. Vasin, O. V. Kamlovskii, V. V. Mizerov
Properties of distributions of elements in one class of sequences over Galois rings
Mat. Vopr. Kriptogr., 2021, 12:4, 25–41
|
V. A. Vatutin
On the closeness of distribution of some random variable to the equiprobable one
Mat. Vopr. Kriptogr., 2023, 14:1, 5–14
|
V. A. Vatutin
Conditional limit theorem for the near critical branching processes with final type of particles
Mat. Vopr. Kriptogr., 2018, 9:4, 53–72
|
V. A. Vatutin
Asymptotic properties of the number of inversions in a random forest
Mat. Vopr. Kriptogr., 2020, 11:4, 7–22
|
V. A. Vatutin
Asymptotic properties of the inversion number in colored trees
Mat. Vopr. Kriptogr., 2019, 10:4, 9–24
|
A. N. Veligura
On approximations of Boolean functions by linear spreads
Mat. Vopr. Kriptogr., 2023, 14:1, 15–25
|
V. E. Viktorenkov
Cycle structure of random substitutions on the set of two-color elements. II
Mat. Vopr. Kriptogr., 2021, 12:1, 5–21
|
V. E. Viktorenkov
Cycle structure of random substitutions on the set of two-color elements. III
Mat. Vopr. Kriptogr., 2022, 13:1, 7–31
|
V. E. Viktorenkov
Cycle structure of random permutations on the set of two-color elements. I
Mat. Vopr. Kriptogr., 2019, 10:3, 9–32
|
V. E. Viktorenkov
Cycle structure of random substitutions on the set of two-color elements. IV
Mat. Vopr. Kriptogr., 2023, 14:4, 5–23
|
V. V. Vlasova, M. A. Pudovkina
Group properties of block ciphers of the Russian standards GOST R 34.11-2012 and GOST R 34.12-2015
Mat. Vopr. Kriptogr., 2018, 9:2, 59–70
|
A. V. Volgin, see V. G. Mikhailov
Mat. Vopr. Kriptogr., 2016, 7:3, 61–72
|
V. V. Vysotskaya
Probabilistic properties of modular addition
Mat. Vopr. Kriptogr., 2021, 12:1, 109–130
|
V. V. Vysotskaya
Some properties of modular addition
Mat. Vopr. Kriptogr., 2019, 10:2, 75–88
|
V. A. Yakovlev, see V. I. Korzhik
Mat. Vopr. Kriptogr., 2021, 12:3, 125–141
|
A. M. Youssef, see R. AlTawy
Mat. Vopr. Kriptogr., 2016, 7:2, 21–34
|
D. I. Zadorozhny, see V. M. Fomichev
Mat. Vopr. Kriptogr., 2019, 10:2, 181–191
|
M. V. Zaets
Construction of substitutions by means of variationally-coordinate polynomial functions over the primary residue ring
Mat. Vopr. Kriptogr., 2015, 6:1, 5–32
|
M. V. Zaec, V. G. Nikonov, F. B. Shishkov
A class of functions with coordinate-dependent polynomiality over the ring $\mathbb Z_{2^m}$
Mat. Vopr. Kriptogr., 2013, 4:3, 21–47
|
S. N. Zaitsev
Description of maximal skew linear recurrences in terms of multipliers
Mat. Vopr. Kriptogr., 2014, 5:2, 57–70
|
S. N. Zaitsev, see M. A. Goltvanitsa
Mat. Vopr. Kriptogr., 2013, 4:2, 59–72
|
P. N. Zakrevskiy
Computation of the additivity coefficient of some bijunctive, weakly positive and weakly negative Boolean functions
Mat. Vopr. Kriptogr., 2015, 6:3, 75–88
|
K. D. Zhukov
Approximate common divisor problem and continued fractions
Mat. Vopr. Kriptogr., 2016, 7:2, 61–70
|
K. D. Zhukov
Approximate common divisor problem and lattice sieving
Mat. Vopr. Kriptogr., 2018, 9:2, 87–98
|
K. D. Zhukov
On a generalization of the Dujella method
Mat. Vopr. Kriptogr., 2013, 4:3, 7–19
|
A. G. Zhuvikin, see V. I. Korzhik
Mat. Vopr. Kriptogr., 2021, 12:3, 125–141
|
M. T. Ziiatdinov, see A. V. Vasiliev
Mat. Vopr. Kriptogr., 2016, 7:2, 47–52
|
P. A. Zolotykh, see A. V. Gribov
Mat. Vopr. Kriptogr., 2010, 1:4, 23–32
|
A. M. Zubkov, A. A. Serov
A natural approach to the experimental study of dependence between statistical tests
Mat. Vopr. Kriptogr., 2021, 12:1, 131–142
|
A. M. Zubkov, V. I. Kruglov
Statistical characteristics of weight spectra of random linear codes over $\mathrm{GF}(p)$
Mat. Vopr. Kriptogr., 2014, 5:1, 27–38
|
A. M. Zubkov, G. I. Ivchenko, Yu. I. Medvedev
The roots of generating functions and sums of integer-valued random variables
Mat. Vopr. Kriptogr., 2020, 11:1, 27–46
|
A. M. Zubkov, A. A. Serov
Experimental study of NIST Statistical Test Suite ability to detect long repetitions in binary sequences
Mat. Vopr. Kriptogr., 2023, 14:2, 137–145
|
A. M. Zubkov
Computation of distributions of the numbers of components and cyclic points for random mappings
Mat. Vopr. Kriptogr., 2010, 1:2, 5–18
|
A. M. Zubkov, A. A. Serov
Testing the NIST Statistical Test Suite on artificial pseudorandom sequences
Mat. Vopr. Kriptogr., 2019, 10:2, 89–96
|
A. M. Zubkov, V. I. Kruglov
On quantiles of minimal codeword weights of random linear codes over $\mathbf{F}_p$
Mat. Vopr. Kriptogr., 2018, 9:2, 99–102
|
A. M. Zubkov, see S. M. Buravlev
Mat. Vopr. Kriptogr., 2011, 2:3, 111–112
|
A. M. Zubkov
Estimates for the variational distance between two sets of independent random variables
Mat. Vopr. Kriptogr., 2020, 11:3, 21–29
|
A. M. Zubkov
Entropy as the quality characteristic of random sequences
Mat. Vopr. Kriptogr., 2021, 12:3, 31–48
|
A. M. Zubkov
New estimates for the variational distance between two distributions of a sample
Mat. Vopr. Kriptogr., 2018, 9:3, 45–60
|
A. M. Zubkov
Moments of weights of random nonuniform Boolean functions
Mat. Vopr. Kriptogr., 2014, 5:3, 5–15
|
A. M. Zubkov, see G. V. Balakin
Mat. Vopr. Kriptogr., 2020, 11:4, 5–6
|
A. M. Zubkov
Statistical tests for uniformity of distribution and independence of vectors based on pairwise distances
Mat. Vopr. Kriptogr., 2023, 14:4, 55–70
|
A. M. Zubkov, V. I. Kruglov
Moments of codeword weights in random binary linear codes
Mat. Vopr. Kriptogr., 2012, 3:4, 55–70
|
A. M. Zubkov, V. O. Mironkin
Distribution of the length of aperiodicity segment in the graph of $k$-fold iteration of uniform random mapping
Mat. Vopr. Kriptogr., 2017, 8:4, 63–74
|
A. Yu. Zubov
Authentication codes with secrecy (survey)
Mat. Vopr. Kriptogr., 2017, 8:3, 5–40
|
A. Yu. Zubov
Block running key cryptosystem with authentication
Mat. Vopr. Kriptogr., 2022, 13:4, 5–35
|
A. V. Zyazin, see S. Yu. Katyshev
Mat. Vopr. Kriptogr., 2020, 11:3, 31–39
|
