Research and comparative analysis of algorithms of asymmetric encryption

Abstract

Using a developed software product, a comparative analysis of asymmetric text data encryption algorithms, their advantages and disadvantages, cryptographic strength, experimental evaluation of their characteristics with respect to the efficiency of their computer memory usage, the duration of key generation, data encryption and decryption ability of algorithms, key dimensions, volumes of encrypted and decrypted files has been made. Based on the results obtained, recommendations were given on the use of the encryption methods considered. The RSA and ElGamal algorithms are chosen as asymmetric encryption algorithms.From the point of view of practical implementation, both in software and hardware, there is no tangible difference between these two methods. However, in their characteristics they are noticeably different. Briefly, the main estimated results obtained are as follows: the cryptographic strength of the ElGamal algorithm is significantly higher than that of the RSA algorithm; the RSA algorithm has a higher speed when encrypting information, and the ElGamal algorithm has the best during decryption; as the key sizes increase, the decryption time by the RSA algorithm grows exponentially, while the duration of the decryption by the ElGamal algorithm has a linear growth order; the RSA algorithm showed 2 times better bandwidth than the ElGamal algorithm in the process of encoding information, but the ElGamal algorithm proved 10 times better throughput compared to the RSA algorithm in the process of decrypting information; the length of the encrypted data by the ElGamal algorithm is 2 times longer than the original data, while the size of the data encrypted by the RSA algorithm is larger than the size of the original data by an average of 1.4; for all key lengths, the ElGamal algorithm creates a pair of public and private keys on average 10 times faster than the RSA algorithm, which is especially noticeable with a significant increase in key sizes; for the ElGamal algorithm, the key generation time increases linearly with increasing key sizes, while for the RSA algorithm it grows exponentially.