Realization of RSA Cryptographic Algorithm Based on Vector-Module Method of Modular Exponention

Submitted by grigby1 on Mon, 12/30/2019 - 2:18pm

Title	Realization of RSA Cryptographic Algorithm Based on Vector-Module Method of Modular Exponention
Publication Type	Conference Paper
Year of Publication	2018
Authors	Yakymenko, I. Z., Kasianchuk, M. M., Ivasiev, S. V., Melnyk, A. M., Nykolaichuk, Ya. M.
Conference Name	2018 14th International Conference on Advanced Trends in Radioelecrtronics, Telecommunications and Computer Engineering (TCSET)
ISBN Number	978-1-5386-2556-9
Keywords	computational complexity, computer security, Decoding, Economics, Encryption, exponentiation, graph theory, modular exponentiation, modular exponention, Modular Multiplication, pubcrawl, public key cryptography, Resiliency, RSA cryptographic algorithm, RSA cryptosystem, Scalability, temporal complexity, Time complexity, vector-modular method, vector-module method, Vectors
Abstract	The improvement of the implementation of the RSA cryptographic algorithm for encrypting / decoding information flows based on the use of the vector-modular method of modular exponential is presented in this paper. This makes it possible to replace the complex operation of modular multiplication with the addition operation, which increases the speed of the RSA cryptosystem. The scheme of algorithms of modular multiplication and modular exponentiation is presented. The analytical and graphical comparison of the time complexities of the proposed and known approaches shows that the use of the vector-modular method reduces the temporal complexity of the modular exponential compared to the classical one.
URL	https://ieeexplore.ieee.org/document/8336262
DOI	10.1109/TCSET.2018.8336262
Citation Key	yakymenko_realization_2018

Groups:

Science of Security VO