Organization of fast exponentiation on galois fields for cryptographic data protection systems

dc.contributor.authorHalil, Al-Mrayt Ghassan Abdel Jalil
dc.contributor.authorMarkovskiy, Oleksandr
dc.contributor.authorStupak, Alona
dc.date.accessioned2023-04-20T04:42:54Z
dc.date.available2023-04-20T04:42:54Z
dc.date.issued2022
dc.description.abstractThe 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.uk
dc.format.pagerangePp. 17-25uk
dc.identifier.citationHalil, 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.uk
dc.identifier.doihttps://doi.org/10.20535/2708-4930.3.2022.265480
dc.identifier.orcid0000-0002-1610-1119uk
dc.identifier.orcid0000-0003-3483-4233uk
dc.identifier.orcid0000-0002-3491-7365uk
dc.identifier.urihttps://ela.kpi.ua/handle/123456789/54731
dc.language.isoenuk
dc.publisherNational Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"uk
dc.publisher.placeKyivuk
dc.relation.ispartofInformation, Computing and Intelligent systems, No. 3uk
dc.subjectmultiplication operation on Galois fieldsuk
dc.subjectcryptographic algorithms based on Galois Fields algebrauk
dc.subjectGalois Fields exponentiationuk
dc.subjectMontgomery reductionuk
dc.subject.udc004.056.5uk
dc.titleOrganization of fast exponentiation on galois fields for cryptographic data protection systemsuk
dc.typeArticleuk

Файли

Контейнер файлів
Зараз показуємо 1 - 1 з 1
Вантажиться...
Ескіз
Назва:
265480-620692-1-10-20221216.pdf
Розмір:
405.56 KB
Формат:
Adobe Portable Document Format
Опис:
Ліцензійна угода
Зараз показуємо 1 - 1 з 1
Ескіз недоступний
Назва:
license.txt
Розмір:
9.1 KB
Формат:
Item-specific license agreed upon to submission
Опис: