Moldovyan Nikolay Andreevich

Publications in Math-Net.Ru

1. Post-quantum public-key cryptoschemes on finite algebras
   
   Informatics and Automation, 23:4 (2024),  1246–1276
2. Finite algebras in the design of multivariate cryptography algorithms
   
   Bul. Acad. Ştiinţe Repub. Mold. Mat., 2023, no. 3,  80–89
3. 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
4. Post-quantum signature scheme on matrix algebra
   
   Sistemy i Sredstva Inform., 31:4 (2021),  38–47
5. 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
6. Signature schemes on algebras, satisfying enhanced criterion of post-quantum security
   
   Bul. Acad. Ştiinţe Repub. Mold. Mat., 2020, no. 2,  62–67
7. Candidate for practical post-quantum signature scheme
   
   Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 16:4 (2020),  455–461
8. Commutative encryption method based on hidden logarithm problem
   
   Vestnik YuUrGU. Ser. Mat. Model. Progr., 13:2 (2020),  54–68
9. Finite non-commutative associative algebras for setting the hidden discrete logarithm problem and post-quantum cryptoschemes on its base
   
   Bul. Acad. Ştiinţe Repub. Mold. Mat., 2019, no. 1,  71–78
10. New forms of defining the hidden discrete logarithm problem
    
    Tr. SPIIRAN, 18:2 (2019),  504–529
11. Post-quantum electronic digital signature scheme based on the enhanced form of the hidden discrete logarithm problem
    
    Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 15:2 (2019),  212–220
12. Finite non-commutative associative algebras as carriers of hidden discrete logarithm problem
    
    Vestnik YuUrGU. Ser. Mat. Model. Progr., 12:1 (2019),  66–81
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. Short signatures from the difficulty of factoring problem
    
    Bul. Acad. Ştiinţe Repub. Mold. Mat., 2013, no. 2-3,  27–36
18. Structure peculiarities of the finite vector groups and their use in the cryptoscheme design
    
    Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 2011, no. 4,  84–93
19. Information authentication in automated control systems based on finite groups with multidimensional cyclicity
    
    Avtomat. i Telemekh., 2009, no. 8,  177–190
20. Vector form of the finite fields $GF(p^m)$
    
    Bul. Acad. Ştiinţe Repub. Mold. Mat., 2009, no. 3,  57–63
21. Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces
    
    Avtomat. i Telemekh., 2008, no. 12,  163–177
22. New algorithms and protocols for information authentication in automatic control systems
    
    Avtomat. i Telemekh., 2008, no. 7,  157–169
23. Protective Data Transformations in ACSs on the Basis of a New Primitive
    
    Avtomat. i Telemekh., 2002, no. 12,  147–165
24. Controlled Operation-Based Fast Methods of Data Protection in Automated Control Systems
    
    Avtomat. i Telemekh., 2001, no. 6,  168–184
25. Fast data encryption for automatic control systems
    
    Avtomat. i Telemekh., 2000, no. 4,  151–165
26. Flexible algorithms for protection of information in automatic control systems
    
    Avtomat. i Telemekh., 1998, no. 8,  166–176
27. Phonon spectrum and band edge absorption in $\mathrm{CdAl}_{2}\mathrm{S}_{4}$
    
    Fizika Tverdogo Tela, 34:3 (1992),  967–969