|
|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
| 1. |
S. V. Vostokov, R. P. Vostokova, E. V. Ikonnikova, “The Hensel–Shafarevich canonical basis in Honda formal modules”, Chebyshevskii Sb., 21:1 (2020), 368–373  |
|
2018 |
| 2. |
S. V. Vostokov, R. P. Vostokova, S. V. Bezzateev, “Number theory and applications in cryptography”, Chebyshevskii Sb., 19:3 (2018), 61–73  |
|
2016 |
| 3. |
S. V. Vostokov, R. P. Vostokova, I. A. Budanaev, “Asymmetric ID-based encryption system, using an explicit pairing function of the reciprocity law”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2016, no. 2, 40–44 |
|
2015 |
| 4. |
S. S. Afanas'eva, R. P. Vostokova, “Logarithms of formal $A$-modules in the case of small ramification”, Algebra i Analiz, 27:6 (2015), 6–13  ; St. Petersburg Math. J., 27:6 (2016), 863–868   |
4
|
| 5. |
A. I. Madunts, R. P. Vostokova, “Formal modules for generalized Lubin–Tate groups”, Zap. Nauchn. Sem. POMI, 435 (2015), 95–112 ; J. Math. Sci. (N. Y.), 219:4 (2016), 553–564 |
7
|
|
2014 |
| 6. |
S. S. Afanas'eva, R. P. Vostokova, G. K. Pak, “Classification of logarithm of multidimensional formal group in a local field”, Zap. Nauchn. Sem. POMI, 430 (2014), 13–17 ; J. Math. Sci. (N. Y.), 219:3 (2016), 343–345 |
1
|
|
| Presentations in Math-Net.Ru |
| 1. |
Shafarevich Basis of the formal modules of the Lubin–Tate and Honda groups
S. V. Vostokov, R. P. Vostokova
XVI International Conference «Algebra, Number Theory and Discrete Geometry: modern problems, applications and problems of history» dedicated to the 80th anniversary of the birth of Professor Michel Desa
May 17, 2019 10:40
|
| 2. |
Canonical Hensel–Shafarevich basis in Honda formal modules
S. V. Vostokov, R. P. Vostokova, E. V. Ikonnikova
XV International Conference «Algebra, Number Theory and Discrete Geometry: modern problems and applications», dedicated to the centenary of the birth of the Doctor of Physical and Mathematical Sciences, Professor of the Moscow State University Korobov Nikolai Mikhailovich
May 29, 2018 15:30
|
|
|
| Organisations |
|
| |
|
|
Contact us: