Article Per Year (5 Year)
p-Index From 2020 - 2025
2.612
P-Index
This Author published in this journals
All Journal Lontar Komputer: Jurnal Ilmiah Teknologi Informasi Techno.Com: Jurnal Teknologi Informasi Jurnal Edukasi dan Penelitian Informatika (JEPIN) PROCEEDING IC-ITECHS 2014 Jurnal Teknologi dan Sistem Komputer Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) JRST (Jurnal Riset Sains dan Teknologi) JURTEKSI JPPM (Jurnal Pengabdian dan Pemberdayaan Masyarakat) Jurnal Repositor Jurnal Pengabdian Masyarakat - Teknologi Digital Indonesia JIPETIK:Jurnal Ilmiah Penelitian Teknologi Informasi & Komputer
Aminudin Aminudin
Universitas Muhammadiyah Malang
Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Education Electrical & Electronics Engineering Engineering Environmental Science Public Health Social Sciences Other

Published : 22 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Jurnal Teknologi dan Sistem Komputer

 1 
Algoritme RSA menggunakan pembangkit kunci ESRKGS untuk enkripsi pesan chat dengan protokol TCP/IP Aminudin Aminudin; Gadhing Putra Aditya; Sofyan Arifianto
Jurnal Teknologi dan Sistem Komputer Volume 8, Issue 2, Year 2020 (April 2020)
Publisher : Department of Computer Engineering, Engineering Faculty, Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/jtsiskom.8.2.2020.113-120

Abstract

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.
Co-Authors Basri Basren Basuki, Setio Dana Putri Harum Eko Budi Cahyono Gadhing Putra Aditya Hafizh Salsabila Pradana Insiyatul Iftitah Muhammad Alwi Muhammad Daffa Muhammad Furqon Sidiq Muhammad Iqbal Naufal Ilmi Muhammad Virgiawan Muhammad Yusuf Nabilah Arwa Nur Annisa Fitriani Nuryasin, Ilyas Pitra Nur Dwijayanto Limbong Rama Haryamadha Roy Inzaqhi Saputra Shinta Permatasari Shinta Permatasari Sofyan Arifianto Zamah Sari