Open AccessRSA algorithm using key generator ESRKGS to encrypt chat messages with TCP/IP protocol
Author(s) -
Aminudin Aminudin,
Gadhing Putra Aditya,
Sofyan Arifianto
Publication year - 2020
Publication title -
jurnal teknologi dan sistem komputer
Language(s) - English
Resource type - Journals
eISSN - 2620-4002
pISSN - 2338-0403
DOI - 10.14710/jtsiskom.8.2.2020.113-120
Subject(s) - key generation , key (lock) , encryption , computer science , public key cryptography , algorithm , prime number , prime factor , prime (order theory) , mathematics , arithmetic , theoretical computer science , computer network , computer security , discrete mathematics , combinatorics
This study aims to analyze the performance and security of the RSA algorithm in combination with the key generation method of enhanced and secured RSA key generation scheme (ESRKGS). ESRKGS is an improvement of the RSA improvisation by adding four prime numbers in the property embedded in key generation. This method was applied to instant messaging using TCP sockets. The ESRKGS+RSA algorithm was designed using standard RSA development by modified the private and public key pairs. Thus, the modification was expected to make it more challenging to factorize a large number n into prime numbers. The ESRKGS+RSA method required 10.437 ms faster than the improvised RSA that uses the same four prime numbers in conducting key generation processes at 1024-bit prime number. It also applies to the encryption and decryption process. In the security testing using Fermat Factorization on a 32-bit key, no prime number factor was found. The test was processed for 15 hours until the test computer resource runs out.