Organization of fast exponentiation on galois fields for cryptographic data protection systems
Вантажиться...
Дата
2022
Науковий керівник
Назва журналу
Номер ISSN
Назва тому
Видавець
National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
Анотація
The article proposes the organization of accelerated execution of the basic operation of a wide range of cryptographic algorithms with a public key - exponentiation on finite Galois fields GF(2n ). Acceleration of the computational implementation of this operation is achieved by organizing the processing of several bits of the code at once during squaring on Galois fields. This organization is based on the use of polynomial squared properties, Montgomery group reduction, and extensive use of previous calculations. Procedures for performing basic operations of exponentiation on Galois fields are developed in detail, the work of which is illustrated by numerical examples. It has been proved that the proposed organization can increase the computational speed of this operation by 2.4 times, which is significant for cryptographic applications.
Опис
Ключові слова
multiplication operation on Galois fields, cryptographic algorithms based on Galois Fields algebra, Galois Fields exponentiation, Montgomery reduction
Бібліографічний опис
Halil, A. Organization of fast exponentiation on galois fields for cryptographic data protection systems / Halil Al-Mrayt Ghassan Abdel Jalil, Markovskiy Oleksandr, Stupak Alona // Information, Computing and Intelligent systems. – 2022. – No. 3. – Pp. 17–25. – Bibliogr.: 25 ref.