Information, Computing and Intelligent systems, No. 3

Постійне посилання зібрання

https://ela.kpi.ua/handle/123456789/54716

Переглянути

Перегляд Information, Computing and Intelligent systems, No. 3 за Автор "Markovskyi, Oleksandr"

Зараз показуємо 1 - 4 з 4
  • Ескіз
    ДокументВідкритий доступ
    Fast secure calculation of the open key cryptography procedures for IoT in clouds
    (National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", 2022) Mirataei, Alireza; Markovskyi, Oleksandr; Haidukevych, Maria
    The article proposes a method for accelerating the implementation of cryptographic data protection mechanisms on embedded IoT terminal microcontrollers, the basic operation of which is the modular exponentiation of high-capacity numbers. The method is based on the use of remote computer systems to speed up calculations and provides protection against the reconstruction of the secret keys of cryptosystems from data transmitted to the cloud. It has been theoretically and experimentally proven that the method allows, on average, 50 times, to speed up the implementation of cryptographic data protection protocols in IoT while providing a level of security sufficient for most practical applications.
  • Ескіз
    ДокументВідкритий доступ
    Organization of parallel execution of modular multiplication to speed up the computational implementation of public-key cryptography
    (National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", 2022) Boyarshin, Igor; Markovskyi, Oleksandr; Ostrovska, Bogdana
    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.
  • Ескіз
    ДокументВідкритий доступ
    Organization of protected filtering of images in clouds
    (National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", 2022) Mirataei, Alireza; Rusanova, Olga; Tribynska, Karolina; Markovskyi, Oleksandr
    The article proposes an approach to using cloud technologies to accelerate the filtering of image streams while ensuring their protection during processing on remote computer systems. Homomorphic encryption of images during their remote filtering is proposed to be carried out by shuffling rows of pixel matrices. This provides a high level of protection against attempts to illegally restore images on computer systems that filter them. The developed approach makes it possible to speed up the performance of this important image processing operation by 1-2 orders of magnitude.
  • Ескіз
    ДокументВідкритий доступ
    Zero-knowledge identification of remote users by utilization of pseudorandom sequences
    (National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", 2022) Daiko, Ihor; Selivanov, Viktor; Chernyshevych, Miroslava; Markovskyi, Oleksandr
    The article theoretically substantiates, proposes and investigates an identification scheme based on the concept of "zero knowledge" using irreversible generators of pseudorandom bit sequences. Session passwords form a chain generated by selective sequence values. Secondary identification sessions are provided in the proposed scheme to counter attacks with the displacement of one of the remote interaction parties. The main elements of the proposed identification scheme are developed in detail: authorization procedures, primary and secondary identification.