TESTING OF PARALLEL CRYPTOGRAPHIC ALGORITHMS

Autor: Bildziuk, Dzianis, Mikhaylov, Dmitry, Shazhaev, Ilman
Jazyk: angličtina
Rok vydání: 2022
Zdroj: Journal of Management & Technology; v. 22 (2022): Journal of Management & Technology, Special Edition; 73-101
Revista Gestão & Tecnologia; v. 22 (2022): Journal of Management & Technology, Special Edition; 73-101
ISSN: 2177-6652
1677-9479
Popis: The article considered the algorithms of the constituent primitive operations of asymmetric algorithms for cryptographic data transformation, which can be implemented in parallel computing systems (FPGA, GPGPU, quantum computers etc.) to accelerate cryptographic transformations. As a basis for the implementation of cryptographic primitives, it is proposed to use non-positional number systems. In particular, the article considered the residual number system and proposes two new - frequency and coordinate number systems, based on Fourier and Tom-Cook interpolation bijective mappings over a ring of integers, as well as the implementation of addition, multiplication and division with a remainder in these systems for the implementation of modular arithmetic at finite algebraic structures. The analysis of the computational and spatial complexity of cryptographic algorithms in suggested number systems is presented. As a result, the advantages of non-positional number systems are shown in the implementation of asymmetric algorithms for asymmetric cryptographic data transformation in parallel computing systems.
Databáze: OpenAIRE