Smyshlyaev Stanislav Vitalevich

Publications in Math-Net.Ru

1. Two-party GOST signature scheme
   
   Mat. Vopr. Kriptogr., 15:2 (2024),  7–28
2. Forcing future public ephemeral keys to attack authenticated key establishment protocols
   
   Prikl. Diskr. Mat., 2024, no. 66,  60–77
3. On the (im)possibility of secure ElGamal blind signatures
   
   Mat. Vopr. Kriptogr., 14:2 (2023),  25–42
4. $\mathsf{sMGM}$: parameterizable AEAD mode
   
   Mat. Vopr. Kriptogr., 14:2 (2023),  7–24
5. IQRA: Incremental Quadratic Re-keying friendly Authentication scheme
   
   Mat. Vopr. Kriptogr., 13:3 (2022),  5–35
6. Secure implementation of digital signature using semi-trusted computational core
   
   Mat. Vopr. Kriptogr., 12:4 (2021),  5–23
7. Improving the security of ElGamal-type signatures
   
   Mat. Vopr. Kriptogr., 12:3 (2021),  5–30
8. On methods of shortening ElGamal-type signatures
   
   Mat. Vopr. Kriptogr., 12:2 (2021),  75–91
9. Impact of randomization in VKO mechanisms on overall security level
   
   Prikl. Diskr. Mat., 2021, no. 54,  77–93
10. On security of the SESPAKE protocol
    
    Prikl. Diskr. Mat., 2020, no. 50,  5–41
11. Data storage security and full disk encryption
    
    Prikl. Diskr. Mat., 2020, no. 49,  78–97
12. Practical significance of security bounds for standardized internally re-keyed block cipher modes
    
    Mat. Vopr. Kriptogr., 10:2 (2019),  31–46
13. On the security properties of Russian standardized elliptic curves
    
    Mat. Vopr. Kriptogr., 9:3 (2018),  5–32
14. On cryptographic properties of the $CVV$ and $PVV$ parameters generation procedures in payment systems
    
    Mat. Vopr. Kriptogr., 9:2 (2018),  23–46
15. Solving systems of linear Boolean equations with noisy right-hand sides over the reals
    
    Diskr. Mat., 29:1 (2017),  3–9
16. On the properties of the CTR encryption mode of Magma and Kuznyechik block ciphers with re-keying method based on CryptoPro Key Meshing
    
    Mat. Vopr. Kriptogr., 8:2 (2017),  39–50
17. On $1$-stable perfectly balanced Boolean functions
    
    Diskr. Mat., 28:2 (2016),  117–126
18. A review of the password authenticated key exchange protocols vulnerabilities and principles of the SESPAKE protocol construction
    
    Mat. Vopr. Kriptogr., 7:4 (2016),  7–28
19. On the cryptographic properties of algorithms accompanying the applications of standards GOST R 34.11-2012 and GOST R 34.10-2012
    
    Mat. Vopr. Kriptogr., 7:1 (2016),  5–38
20. On the performance of one perspective LSX-based block cipher
    
    Mat. Vopr. Kriptogr., 6:2 (2015),  7–17
21. On the invariance of perfect balancedness property under the choice of tapping sequence
    
    Mat. Vopr. Kriptogr., 5:2 (2014),  127–135
22. Construction of RNG using random automata and “one-way” functions
    
    Mat. Vopr. Kriptogr., 5:2 (2014),  109–115
23. Perfectly balanced $k$-valued functions and the Golić condition
    
    Diskr. Mat., 25:1 (2013),  63–75
24. Connections between some parameters of perfectly balanced Boolean functions
    
    Prikl. Diskr. Mat., 2013, no. 2(20),  19–25
25. On $\rho$-balanced Boolean functions
    
    Diskr. Mat., 24:2 (2012),  154–159
26. Perfect balancedness of $k$-valued functions and Golić condition
    
    Prikl. Diskr. Mat. Suppl., 2012, no. 5,  28–30
27. Boolean functions without prediction
    
    Diskr. Mat., 23:1 (2011),  102–118
28. Locally invertible Boolean functions
    
    Prikl. Diskr. Mat., 2011, no. 4(14),  11–21
29. On the number of perfectly balanced Boolean functions with barrier of length $3$
    
    Prikl. Diskr. Mat., 2011, no. 1(11),  26–33
30. Barriers of perfectly balanced Boolean functions
    
    Diskr. Mat., 22:2 (2010),  66–79
31. Construction of perfectly balanced functions without barriers
    
    Prikl. Diskr. Mat., 2010, no. 3(9),  41–50
32. On cryptographic weaknesses of some classes of binary sequence transformations
    
    Prikl. Diskr. Mat., 2010, no. 1(7),  5–15
33. New methods of investigation of perfectly balanced Boolean functions
    
    Diskr. Mat., 21:2 (2009),  51–74