skip to main content

Algoritme RSA menggunakan pembangkit kunci ESRKGS untuk enkripsi pesan chat dengan protokol TCP/IP

RSA algorithm using key generator ESRKGS to encrypt chat messages with TCP/IP protocol

Universitas Muhammadiyah Malang, Indonesia

Received: 24 Sep 2019; Revised: 3 Feb 2020; Accepted: 7 Feb 2020; Available online: 15 Feb 2020; Published: 30 Apr 2020.
Open Access Copyright (c) 2020 Jurnal Teknologi dan Sistem Komputer
Creative Commons License This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Citation Format:
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.
Keywords: prime numbers; RSA algorithm; RSA ESRKGS; Fermat factorization
Funding: Universitas Muhammadiyah Malang

Article Metrics:

  1. W. Stallings, cryptography and network security principles and practice, 7th edition. Pearson, 2016
  2. S. Upadhyay, “Attack on RSA cryptosystem,” International Journal of Scientific and Engineering Research, vol. 2, no. 9, pp. 1–4, 2011
  3. M. Preetha and M. Nithya, “A study and performance analysis of RSA algorithm,” International Journal of Computer Science and Mobile Computing, vol. 2, no. 6, pp. 126–139, 2013
  4. M. Shringirishi, A. K. Solanki, M. Gupta, Y. Singh, and P. Gupta, “Novel Approach to Factorize the RSA Public Key Encryption,” International Journal of Advanced Research in Computer Science, vol. 6, no. 6, pp. 172–176, 2015
  5. A. Fatima and R. R. Chaudhary, “Modified trial division algorithm using lagrange’s interpolation function to factorize RSA public key encryption,” International Journal of Advance Research and Innovative Ideas in Education, vol. 3, no. 3, pp. 1861–1865, 2017
  6. B. R. Ambedkar, A. Gupta, P. Gautam, and S. S. Bedi, “An efficient method to factorize the RSA public key encryption,” in 2011 International Conference on Communication Systems and Network Technologies, Katra, India, Jun. 2011, pp. 108-111. doi: 10.1109/CSNT.2011.29
  7. A. Arief, “Implementasi kriptografi kunci publik dengan algoritma RSA-CRT pada aplikasi instant messaging,” Scientific Journal of Informatics, vol. 3, no. 1, pp. 46–54, 2016. doi: 10.15294/sji.v3i1.6115
  8. M. Cai, “The design method of network chat system based on socket and cloud computing,” in 2012 International Conference on Computer Science and Service System, Nanjing, China, Aug. 2012, pp. 610–613. doi: 10.1109/CSSS.2012.157
  9. A. Aminudin, A. F. Helmi, and S. Arifianto, “Analisa kombinasi algoritma Merkle-Hellman Knapscak dan logaritma diskrit pada aplikasi chat,” Jurnal Teknologi Informasi dan Ilmu Komputer, vol. 5, no. 3, pp. 325–334, 2018. doi: 10.25126/jtiik.201853844
  10. N. Somani and D. Mangal, “An improved RSA cryptographic system,” International Journal of Computer Applications, vol. 105, no. 16, pp. 18-22, 2014. doi: 10.5120/18461-9820
  11. A. H. Al-Hamami and I. A. Aldariseh, “Enhanced method for RSA cryptosystem algorithm,” in 2012 International Conference on Advanced Computer Science Applications and Technologies, Kuala Lumpur, Malaysia, Nov. 2012, pp. 402–408. doi: 10.1109/ACSAT.2012.102
  12. B. P. U. Ivy, P. Mandiwa, and M. Kumar, “A modified RSA cryptosystem based on ‘n’ prime numbers,” International Journal of Engineering and Computer Science, vol. 1, no. 2, pp. 2319–7242, 2012
  13. B. Swami, R. Singh, and S. Choudhary, “Dual modulus RSA based on Jordan-totient function,” Procedia Technology, vol. 24, pp. 1581–1586, 2016. doi: 10.1016/j.protcy.2016.05.143
  14. N. Lal, A. P. Singh, and S. Kumar, “Modified trial division algorithm using KNJ-factorization method to factorize RSA public key encryption,” in 2014 International Conference on Contemporary Computing and Informatics, Mysore, India, Nov. 2014, pp. 992–995. doi: 10.1109/IC3I.2014.7019588

Last update:

  1. Modification of RC4 algorithm utilizing the two-state table and initial state factorial

    A. Aminudin, Ilyas Nuryasin. 1ST INTERNATIONAL CONFERENCE ON TECHNOLOGY, INFORMATICS, AND ENGINEERING, 2453 , 2022. doi: 10.1063/5.0095181
  2. RSA cryptanalysis — Fermat factorization exact bound and the role of integer sequences in factorization problem

    Ahmed S. Shatnawi, Mahmoud M. Almazari, Zakarea AlShara, Eyad Taqieddin, Dheya Mustafa. Journal of Information Security and Applications, 78 , 2023. doi: 10.1016/j.jisa.2023.103614

Last update: 2024-05-24 08:47:14

No citation recorded.