|
|
Publications in Math-Net.Ru |
Citations |
|
2013 |
1. |
M. V. Nikolaev, D. V. Matyukhin, “On the complexity of two-dimensional discrete logarithm problem in a finite cyclic group with effective automorphism of order 6”, Diskr. Mat., 25:4 (2013), 54–65 ; Discrete Math. Appl., 23:3-4 (2013), 313–325 |
2
|
|
2012 |
2. |
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., 3:4 (2012), 71–89 |
5
|
|
2007 |
3. |
D. V. Matyukhin, “On the “weak” keys of Diffie–Hellman problems in a field $F_{p^m}$”, Tr. Diskr. Mat., 10 (2007), 182–187 |
|
2006 |
4. |
D. V. Matyukhin, “Effective version of the number field sieve for discrete logarithm in a field $\mathbf{GF}(p^k)$”, Tr. Diskr. Mat., 9 (2006), 121–151 |
1
|
|
2003 |
5. |
D. V. Matyukhin, “On the asymptotic complexity of computing discrete logarithms in the field $\operatorname{\mathit{GF}}(p)$”, Diskr. Mat., 15:1 (2003), 28–49 ; Discrete Math. Appl., 13:1 (2003), 27–50 |
13
|
|
1995 |
6. |
D. V. Matyukhin, “On positive-definite biquadratic forms that cannot be represented as the sum of squares of bilinear forms”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1995, no. 2, 29–33 |
1
|
|
|
|
2020 |
7. |
G. V. Balakin, S. M. Buravlev, S. P. Gorshkov, A. M. Zubkov, G. I. Ivchenko, A. V. Knyazev, A. P. Kovalenko, O. A. Kozlitin, V. A. Kopyttsev, A. V. Lapshin, D. V. Matyukhin, Yu. I. Medvedev, V. G. Mikhailov, A. V. Mikhalev, Yu. V. Nesterenko, A. B. Pichkur, B. A. Pogorelov, V. N. Sachkov, A. V. Tarasov, I. G. Shaposhnikov, V. A. Shishkin, A. M. Shoitov, “To the memory of Igor Aleksandrovich Kruglov”, Mat. Vopr. Kriptogr., 11:4 (2020), 5–6 |
|
Presentations in Math-Net.Ru |
|
|
Organisations |
|
|
|
|