Moldovyan Aleksandr Andreevich

Publications in Math-Net.Ru

1. Randomization in post-quantum digital signature algorithms with a secret group
   
   Informatics and Automation, 24:6 (2025),  1810–1835
2. Post-quantum public-key cryptoschemes on finite algebras
   
   Informatics and Automation, 23:4 (2024),  1246–1276
3. Parameterized unified method for setting vector finite fields for multivariate cryptography
   
   Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 20:4 (2024),  479–486
4. A new method for developing signature algorithms on finite non-commutative algebras
   
   Bul. Acad. Ştiinţe Repub. Mold. Mat., 2022, no. 1,  56–65
5. Structure of a $4$-dimensional algebra and generating parameters of the hidden discrete logarithm problem
   
   Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 18:2 (2022),  209–217
6. Post-quantum signature scheme on matrix algebra
   
   Sistemy i Sredstva Inform., 31:4 (2021),  38–47
7. Digital signature scheme on the $2 \times 2$ matrix algebra
   
   Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 17:3 (2021),  254–261
8. Candidate for practical post-quantum signature scheme
   
   Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 16:4 (2020),  455–461
9. Commutative encryption method based on hidden logarithm problem
   
   Vestnik YuUrGU. Ser. Mat. Model. Progr., 13:2 (2020),  54–68
10. New forms of defining the hidden discrete logarithm problem
    
    Tr. SPIIRAN, 18:2 (2019),  504–529
11. Finite non-commutative associative algebras as carriers of hidden discrete logarithm problem
    
    Vestnik YuUrGU. Ser. Mat. Model. Progr., 12:1 (2019),  66–81
12. General method for defining finite non-commutative associative algebras of dimension $m>1$
    
    Bul. Acad. Ştiinţe Repub. Mold. Mat., 2018, no. 2,  95–100
13. Methods and algorithms for pseudo-probabilistic encryption with shared key
    
    Tr. SPIIRAN, 61 (2018),  119–146
14. Post-quantum no-key protocol
    
    Bul. Acad. Ştiinţe Repub. Mold. Mat., 2017, no. 3,  115–119
15. Generating cubic equations as a method for public encryption
    
    Bul. Acad. Ştiinţe Repub. Mold. Mat., 2015, no. 3,  60–71
16. Bi-deniable public-key encryption protocol which is secure against active coercive adversary
    
    Bul. Acad. Ştiinţe Repub. Mold. Mat., 2014, no. 3,  23–29
17. Analysis of Certification Dependency of International Standards ISO for Leading Industries
    
    Tr. SPIIRAN, 34 (2014),  160–177
18. Short signatures from the difficulty of factoring problem
    
    Bul. Acad. Ştiinţe Repub. Mold. Mat., 2013, no. 2-3,  27–36
19. New algorithms and protocols for information authentication in automatic control systems
    
    Avtomat. i Telemekh., 2008, no. 7,  157–169
20. Protective Data Transformations in ACSs on the Basis of a New Primitive
    
    Avtomat. i Telemekh., 2002, no. 12,  147–165
21. Controlled Operation-Based Fast Methods of Data Protection in Automated Control Systems
    
    Avtomat. i Telemekh., 2001, no. 6,  168–184
22. Fast data encryption for automatic control systems
    
    Avtomat. i Telemekh., 2000, no. 4,  151–165
23. Flexible algorithms for protection of information in automatic control systems
    
    Avtomat. i Telemekh., 1998, no. 8,  166–176