Organization of parallel execution of modular multiplication to speed up the computational implementation of public-key cryptography
Вантажиться...
Дата
2022
Науковий керівник
Назва журналу
Номер ISSN
Назва тому
Видавець
National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
Анотація
The 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.
Опис
Ключові слова
modular multiplication, Montgomary modular reductions, open key cryptography, parallel computation, multiplicative operations of modular arithmetic
Бібліографічний опис
Boyarshin, 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.