Article Per Year (5 Year)
p-Index From 2021 - 2026
2.255
P-Index
This Author published in this journals
All Journal The IJICS (International Journal of Informatics and Computer Science) JURIKOM (Jurnal Riset Komputer) Building of Informatics, Technology and Science KAKIFIKOM : Kumpulan Artikel Karya Ilmiah Fakultas Ilmu Komputer Jatilima : Jurnal Multimedia Dan Teknologi Informasi Bulletin of Computer Science Research BEES: Bulletin of Electrical and Electronics Engineering Jurnal ABDIMAS Budi Darma Ulead : Jurnal E-pengabdian Jurnal Pengabdian Masyarakat Bangsa Jurnal Sains dan Teknologi Informasi
Chandra Frenki Sianturi
Universitas Budi Darma
Agriculture, Biological Sciences & Forestry Arts Humanities Automotive Engineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Environmental Science Health Professions Industrial & Manufacturing Engineering Law, Crime, Criminology & Criminal Justice Materials Science & Nanotechnology Mathematics Mechanical Engineering Medicine & Pharmacology Nursing Physics Public Health Social Sciences Other

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

Found 1 Documents
Search
Journal : Building of Informatics, Technology and Science

 1 
Modifikasi Pembangkit Kunci Algoritma RSA Dengan Menerapkan Algoritma Blum Blum Shub (BBS) Sianturi, Chandra Frenki
Building of Informatics, Technology and Science (BITS) Vol 2 No 1 (2020): June 2020
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (261.244 KB) | DOI: 10.47065/bits.v2i1.333

Abstract

RSA has two keys, namely public key and secret key. RSA bases its encryption and decryption process on the concepts of prime numbers and modulo arithmetic. Both encryption and decryption keys are integers. The encryption key is not kept secret and given to the public (so called the public key), but the key for decryption is confidential (private key). To find the decryption key, it is done by factoring an integer into its prime factors. Therefore to strengthen the security of the RSA algorithm it is necessary to process the key making by factoring an integer into its prime factors in general. Because this is so common, a key modification to the RSA algorithm needs to be done. Modifications are carried out by using another algorithm that uses random numbers. By entering random numbers, it is considered able to eliminate the possibility of an attacker guessing the results by knowing the algorithm. One of these algorithms is the Blum Blum Shub Algorithm (BBS) algorithm. The purpose of using the Blum Blum Shub (BBS) algorithm is to make the key more difficult to guess, making it difficult for cryptanalysts to read the message or information. Based on the results of the above analysis that the RSA algorithm can be used for key formation by using the Blum Blum Shub algorithm as a key used in the RSA algorithm
Co-Authors Ali Syakban Pulungan Anggraini, Dwi Pertiwi Hutabarat, Sumiati Kahirunisa Kennedi Tampubolon Khairunnisa Khairunnisa Lince Tomoria Sianturi Mesran, Mesran Nabila, Bella Rizka Pratiwi Siagian, Edward Robinson Siburian, Henry Kristian Soeb Aripin Tarigan, Pilipus Uswatun Hasanah