Matyukhin Dmitrii Viktorovich

Publications in Math-Net.Ru

1. 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
2. Some methods of hash functions analysis with application to the GOST P 34.11-94 algorithm
   
   Mat. Vopr. Kriptogr., 3:4 (2012),  71–89
3. On the “weak” keys of Diffie–Hellman problems in a field $F_{p^m}$
   
   Tr. Diskr. Mat., 10 (2007),  182–187
4. Effective version of the number field sieve for discrete logarithm in a field $\mathbf{GF}(p^k)$
   
   Tr. Diskr. Mat., 9 (2006),  121–151
5. On the asymptotic complexity of computing discrete logarithms in the field $\operatorname{\mathit{GF}}(p)$
   
   Diskr. Mat., 15:1 (2003),  28–49
6. 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


7. To the memory of Igor Aleksandrovich Kruglov
   
   Mat. Vopr. Kriptogr., 11:4 (2020),  5–6