Developed on the C# platform (.NET Framework 5.0), which provides high flexibility in work, a program for performing operations (addition, multiplication, raising to the power of a large natural number, finding the inverse relatively to multiplication) on elements of extended finite fields and general linear groups over such fields. The general linear group is one of the wellknown non-Abelian groups, the application of which is actively studied in the field of postquantum cryptography. Using these operations, a number of cryptographic primitives have been implemented: the well-known Diffie-Hellman, Stickel secret key exchange protocols, and recently proposed generalizations of the Lizama-Romero protocol and the Kanwal-Ali asymmetric cryptosystem. The program allows you to explore the features of known and verify new cryptographic primitives. Using it, the trustiness of the two mentioned new primitives for different values of parameters was confirmed.
- Biletskyi A. Ya., Biletskyi A. A., Kandyba R. Yu. Matrychni analohy protokolu Diffi-Khellmana / Herald of Lviv Polytechnic National University, series “Automation, measurement and control”. – 2012. – No 741. –P. 128–133. (in Ukrainian)
- Dunets R., Popovych B., Popovych R. On construction of high order elements in arbitrary finite fields / JP Journal of Algebra, Number Theory and Applications. – 2019. – Vol. 42 (1). – P. 71–76. DOI: http://dx.doi.org/10.17654/NT042010071.
- Galbraith S. D. Mathematics of Public Key Cryptography / S. D. Galbraith. – New York: Cambridge University Press, 2012. – 630 p.
- Kanwal S., Ali R. A cryptosystem with noncommutative platform groups / Neural Computing and Applications. – 2018. – Volume 29. – P. 1273–1278. DOI: https://doi.org/10.1007/s00521-016-2723-8.
- Lizama-Pérez L. A., Romero M. L. Non-Commutative Key Exchange Protocol/ Preprints 2021, 2021030716. DOI: https://doi.org/10.20944/preprints202103.0716.v2.
- Popovych B. R. Kompiuterna perevirka prypushchennia Gao, poviazanoho z otrymanniam elementiv velykoho poriadku v skinchennykh poliakh / Herald of Lviv Polytechnic National University, series “Computer systems and networks”. – 2018. – No. 905. – P. 106–110. (in Ukrainian) DOI: https://doi.org/10.23939/csn2018.905.106.
- Popovych B. R Elementy velykoho multyplikatyvnoho poriadku v rozshyrenykh skinchennykh poliakh na osnovi modyfikovanoho pidkhodu Gao / Scientific journal of Lviv Polytechnic National University “Computer systems and networks”. – 2019. – Issue. 1, No 1. – P. 63–68. (in Ukrainian) DOI: https://doi.org/10.23939/csn2019.01.063.
- Popovych B. R, Popovych R. B. Elementy velykoho poriadku dlia kryptosystem z neabelevymy bazovymy hrupamy / Herald of Khmelnytskyi National University, series “Technical sciences”. – 2023. – No 4. – P. 278–285. (in Ukrainian) DOI: https://www.doi.org/10.31891/2307-5732-2023-323-4-278-285.
- Popovych B. R, Popovych R. B. Uzahalnennia nekomutatyvnoho protokolu uzghodzhennia kliucha / Herald of Khmelnytskyi National University, series “Technical sciences”. – 2024. – No 4. – P. 137–141. (in Ukrainian) DOI: https://doi.org/10.31891/2307-5732-2024-339-4-22.
- Ustimenko V. On computations with double Schubert automaton and stable maps of multivariate cryptography / Interdisciplinary Studies of Complex Systems. – 2021, No. 19, P. 18–32. DOI: https://doi.org/10.31392/iscs.2021.19.018.
- Vavruk E. Y., Popovych B. R, Popovych R. B. Programna model kodiv Rida-Solomona / Scientific journal of Lviv Polytechnic National University “Computer systems and networks”. – 2021. – Issue. 1, No 1. – P. 1–6. (in Ukrainian) DOI: https://doi.org/10.23939/csn2021.01.001.