COMPARATIVE ANALYSIS OF TEXT DATA ASYMMETRIC ENCRYPTION METHODS

T. Matveichuk, V. Smychok, S. Filimonov

Abstract


Actuality. Actuality of work is conditioned by the problem of development of effective methods of defense of information in informative networks which provide the reliable functioning of the automated systems of military purpose, that all computer systems control and connect systems. The complex of experimental researches of directed is a research object, the purpose of which there is comparison of algorithms of the asymmetric enciphering of texts information.

Method. The cycle of experimental tests was carried out after such parameters of algorithms of enciphering: time of generation of the keys; time of enciphering and decoding; carrying capacity of process of enciphering and decoding; size of in cipher and decoded file. The experiments are conducted on the Intel Core 2 Duo CPU processor 2.09 GHz from 4 Gb main memories under the operating system of Windows 7.

Results. The main evaluative 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 shows better results during decryption; with 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 showed 10 times better bandwidth compared to the RSA algorithm in the process of decryption; 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 in geometrical progression.

Conclusions. By the developed software product the comparative analysis of asymmetric algorithms of enciphering of texts information, their advantages and failings, cryptographic firmness, is conducted, given experimental estimation of their descriptions in relation to efficiency of the use by them memory of computer, duration of processes of generation of the keys, enciphering and decoding of information, carrying capacity of algorithms, measure keys, volumes of in ciphers and deciphered files. On the basis of the got results recommendations of application of the considered methods of enciphering are given.

Keywords: programming software, asymmetric algorithms, encryption, decryption, cryptostability, algorithms RSA & ElGamal.


Full Text:

PDF

References


Rivest R. A method for obtaining digital signatures and public-key cryptosystems / R. Rivest, A. Shamir, L. Adleman // New York City: ACM, 1978. – Vol. 21, N 2. – P. 120–126. DOI : 10.1145/357980.358017

Johnson J. Public-key cryptography standards (PKCS) #1 / J. Johnson, B. Kaliski // RSA Cryptography Specifications Version 2.1. Network Working Group, 2003. DOI: 10.17487/RFC3447

Boneh D. Twenty years of attacks on the RSA cryptosystem / D. Boneh // Notices Amer. Math. Soc. F. Morgan-AMS. – 1999. – Vol. 46, N 2. – P. 203–213.

ElGamal T. A public-key cryptosystem and a signature scheme based on discrete logarithms / T. ElGamal // Advances in Cryptology-CRYPTO’84. – 1985. – P. 10–18. DOI : 10.1109/TIT.1985.1057074

Tsiounis Y. On the security of ElGamal based encryption / Y. Tsiounis, M. Yung // Public Key Cryptography. PKC-1998. –Berlin, Heidelberg : Springer, 1998. – Vol. 1431. – P. 117–134.

Bakhtiari M. Serious Security Weakness in RSA Cryptosystem / M. Bakhtiari, M.A. Maarof // IJCSI – 2012. – Vol. 9, N 3. – P. 175–178.

Lenstra A.K. Factoring by electronic mail / A.K. Lenstra, M.S. Manasse // Advances in Cryptology EUROCRYPT '89 Proceeding, Springer Verlag, 1990. – P. 355–371. DOI : 10.1007/3-540-46885-4_35

Barker E.B., Roginsky A.M. Transitioning the Use of Cryptographic Algorithms and Key Lengths. National Institute of Standards and Technology, Gaithersburg, Maryland, NIST Special Publication (SP) 800-131A, Rev. 2, March 2019. DOI : 10.6028/NIST.SP.800-131Ar2

Okeyinka A. E. Computational speeds analysis of RSA and ElGamal algorithms on text data / A. E. Okeyinka // Proceedings of the world congress on engineering and computer science, 21-23 October 2015, San Francisco, USA. – 2015. – P. 115-118.

Mulya M. Perbandingan kecepatan algoritma kriptografi asimetri / Mulya M. // Journal of Research in Computer Science and Applications. – 2013. – Vol. I, N 2. – P. 7–12.

Himawan C. Studi perbandingan algoritma RSA dan algoritma El-Gamal / C. Himawan, T. Wibowo, B. Sulityo, R. Roestam, Y. Wahyu, R.B. Wahyu // Seminar National APTIKOM (SEMNASTIKOM), Hotel Lombok Raya Mataram, 28-29 Oktober 2016. – Vol 1, N 1. – P. 695–700.

Hossain J. A novel keyless and key based encryption algorithm to handle cyber security in microgrid application / J. Hossain, E. Hossain // Gazi University Journal of Science 30(4), Dec. 2017. – 2017. – P. 330–343.

Farah S. An experimental study on performance evaluation of asymmetric encryption algorithms / S. Farah, M. Younas Javed, A. Shamim, T. Nawaz // WSEAS 3rd European conference of computer science (WSEAS ECCS 2012), Greece, Dec. – 2012 – P. 121-124.

Siahaan A., Elviwani, Oktaviana B. Comparative analysis of RSA and ElGamal cryptographic public-key algorithms, 2018. DOI: 10.4108/eai.23-4-2018.2277584




DOI: http://dx.doi.org/10.30970/eli.14.2

Refbacks

  • There are currently no refbacks.