|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
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., 14:3 (2023), 49–73  |
|
2019 |
| 2. |
L. R. Ahmetzyanova, G. A. Karpunin, G. K. Sedov, “Near birthday attack on “$8$ bits” $\mathsf{AEAD}$ mode”, Mat. Vopr. Kriptogr., 10:2 (2019), 47–60 |
|
2018 |
| 3. |
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., 9:2 (2018), 23–46  |
1
|
|
2013 |
| 4. |
G. A. Karpunin, “On probability characteristics of random graphs generated by algorithms for finding hash function collisions”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 33–35 |
|
2012 |
| 5. |
G. A. Karpunin, E. Z. Ermolaeva, “Estimates of collision resistance complexity for the hash function RIPEMD”, Prikl. Diskr. Mat. Suppl., 2012, no. 5, 43–44 |
1
|
|
2004 |
| 6. |
G. A. Karpunin, “On the McEliece public-key cryptosystem based on Reed-Muller binary codes”, Diskr. Mat., 16:2 (2004), 79–84   ; Discrete Math. Appl., 14:3 (2004), 257–262 |
5
|
|
2001 |
| 7. |
G. A. Karpunin, “Minimal Networks on the Regular $n$-Dimensional Simplex”, Mat. Zametki, 69:6 (2001), 854–865 ; Math. Notes, 69:6 (2001), 780–789  |
1
|
| 8. |
G. A. Karpunin, “Universal boundary sets in the generalized Steiner problem”, Zap. Nauchn. Sem. POMI, 279 (2001), 168–182 ; J. Math. Sci. (N. Y.), 119:1 (2004), 86–92 |
|
2000 |
| 9. |
G. A. Karpunin, I. G. Shaposhnikov, “Crossed homomorphisms of finite algebras with a scheme of binary operators”, Diskr. Mat., 12:2 (2000), 66–84 ; Discrete Math. Appl., 10:2 (2000), 183–202 |
2
|
| 10. |
G. A. Karpunin, “An analogue of Morse theory for planar linear networks and the generalized Steiner problem”, Mat. Sb., 191:2 (2000), 64–90 ; Sb. Math., 191:2 (2000), 209–233  |
6
|
|
| Organisations |
|
| |
|
|
Contact us: