Boyarshin, IgorMarkovskyi, OleksandrOstrovska, Bogdana2023-04-202023-04-202022Boyarshin, I. Organization of parallel execution of modular multiplication to speed up the computational implementation of public-key cryptography / Boyarshin Igor, Markovskyi Oleksandr, Ostrovska Bogdana // Information, Computing and Intelligent systems. – 2022. – No. 3. – Pp. 26–32. – Bibliogr.: 15 ref.https://ela.kpi.ua/handle/123456789/54732The article theoretically substantiates, investigates and develops a method for parallel execution of the basic operation of public key cryptography - modular multiplication of numbers with high bit count. It is based on a special organization of the division of the components of modular multiplication into independent computational processes. To implement this, it is proposed to use the Montgomery modular reduction. The described solution is illustrated with numerical examples. It has been theoretically and experimentally proven that the proposed approach to parallelization of the arithmetical process of modular multiplication makes it possible to speed up this important for cryptographic tasks operation by 5-6 times.enmodular multiplicationMontgomary modular reductionsopen key cryptographyparallel computationmultiplicative operations of modular arithmeticArticlePp. 26-32https://doi.org/10.20535/2708-4930.3.2022.265418004. 004.4 (043.2)0000-0002-1727-53050000-0003-3483-42330000-0001-7967-4582