|
|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
| 1. |
M. A. Cherepnev, A. N. Shvetz, “Mathematical modeling of results of borrowing foreign words of the Russian language a reflection of the process of historical interaction between Russians and foreigners”, Comp. nanotechnol., 7:2 (2020), 79–89   |
| 2. |
M. A. Cherepnev, “Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem”, Diskr. Mat., 32:1 (2020), 110–114  ; Discrete Math. Appl., 31:1 (2021), 1–4   |
1
|
|
2016 |
| 3. |
M. A. Cherepnev, “Modular algorithm for reducing matrices to the Smith normal form”, Diskr. Mat., 28:2 (2016), 154–160 ; Discrete Math. Appl., 27:3 (2017), 143–147 |
| 4. |
M. A. Cherepnev, “Extension of the Rissanen algorithm to the factorization of block-Hankel matrices for solving systems of linear equations”, Diskr. Mat., 28:1 (2016), 150–155 ; Discrete Math. Appl., 27:2 (2017), 69–72 |
1
|
|
2014 |
| 5. |
M. A. Cherepniov, N. L. Zamarashkin, “The universal block Lanczos–Padé method for linear systems over large prime fields”, Fundam. Prikl. Mat., 19:6 (2014), 225–249 ; J. Math. Sci., 221:3 (2017), 461–478 |
| 6. |
M. A. Cherepniov, “A note on the kernel of group homomorphism from the Weil descent method”, Fundam. Prikl. Mat., 19:6 (2014), 213–224 ; J. Math. Sci., 221:3 (2017), 452–460 |
|
2013 |
| 7. |
M. A. Cherepniov, “Pairing inversion for finding discrete logarithms”, Fundam. Prikl. Mat., 18:4 (2013), 185–195 ; J. Math. Sci., 206:6 (2015), 734–741 |
|
2012 |
| 8. |
M. A. Cherepniov, “A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery”, Fundam. Prikl. Mat., 17:5 (2012), 211–223 ; J. Math. Sci., 193:4 (2013), 622–630 |
|
2008 |
| 9. |
M. A. Cherepnev, “A block algorithm of Lanczos type for solving sparse systems of linear equations”, Diskr. Mat., 20:1 (2008), 145–150  ; Discrete Math. Appl., 18:1 (2008), 79–84 |
5
|
|
2006 |
| 10. |
M. A. Cherepnev, “Properties of large prime divisors of numbers of the form $p-1$”, Mat. Zametki, 80:6 (2006), 920–925 ; Math. Notes, 80:6 (2006), 863–867 |
2
|
|
2003 |
| 11. |
M. A. Cherepnev, “Public key distribution schemes based on a noncommutative group”, Diskr. Mat., 15:2 (2003), 47–51 ; Discrete Math. Appl., 13:3 (2003), 265–269 |
3
|
|
1996 |
| 12. |
M. A. Cherepnev, “On a connection between the complexities of the discrete logarithmization and the Diffie–Hellman problems”, Diskr. Mat., 8:3 (1996), 22–30 ; Discrete Math. Appl., 6:4 (1996), 341–349 |
8
|
|
1995 |
| 13. |
M. A. Cherepnev, “Algebraic independence of values of hypergeometric $E$-functions”, Mat. Zametki, 57:6 (1995), 896–912 ; Math. Notes, 57:6 (1995), 630–642 |
10
|
|
1994 |
| 14. |
M. A. Cherepnev, “On algebraic independence of some subclasses of hypergeometric functions”, Mat. Zametki, 55:1 (1994), 117–129 ; Math. Notes, 55:1 (1994), 78–85 |
3
|
|
1993 |
| 15. |
V. M. Sidel'nikov, M. A. Cherepnev, V. V. Yashchenko, “Public key distribution systems based on noncommutative
semigroups”, Dokl. Akad. Nauk, 332:5 (1993), 566–567 ; Dokl. Math., 48:2 (1994), 384–386 |
4
|
|
1991 |
| 16. |
M. A. Cherepnev, “On algebraic independence of values of hypergeometric $E$-functions, satisfying linear nonhomogeneous differential equations”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1991, no. 1, 27–33 |
|
1990 |
| 17. |
M. A. Cherepnev, “On the algebraic independence of the values of hypergeometric $E$-functions”, Uspekhi Mat. Nauk, 45:6(276) (1990), 155–156 ; Russian Math. Surveys, 45:6 (1990), 145–146 |
1
|
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: