Modifikasi Pembangkit Kunci Algoritma RSA Dengan Menerapkan Algoritma Blum Blum Shub (BBS)
-
Chandra Frenki Sianturi
*
STMIK Budi Darma, Medan,
Indonesia
(*) Corresponding Author
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
Downloads
References
P. Pahrizal and D. Pratama, “Implementasi Algoritma Rsa Untuk Pengamanan Data Berbentuk Teks,” Pseudocode, vol. 3, no. 1, pp. 44–49, 2016.
T. S. Waruwu and K. Telaumbanua, “Kombinasi Algoritma OTP Cipher dan Algoritma BBS dalam Pengamanan File,” JSM STMIK Mikroskil, vol. 17, no. 1, pp. 119–126, 2016.
M. B. Sanjaya and P. A. Telnoni, “Implementasi Random Number Blum-Blum-Shub Dan Chaotic Function Untuk Modifikasi Key Generating Pada Kriptografi Aes Implementasi Blum-Blum-Shub Dan Chaotic Function Untuk Modifikasi Key Generating Pada Aes Implementation of Blum-Blum-Shub and Chaotic Func,” J. Elektro Telekomun. Terap. Desember, vol. 1, no. 1, pp. 154–165, 2015.
M. I. Zulfikar, G. Abdillah, A. Komarudin, J. Informatika, and F. Sains, “Kriptografi untuk Keamanan Pengiriman Email Menggunakan Blowfish dan Rivest Shamir Adleman (RSA),” Semin. Nas. Apl. Teknol. Inf. 2019, vol. 2, no. 1, pp. 19–26, 2019.
A. N. Agustina, Aryanti, and Nasron, “Pengamanan Dokumen Menggunakan Metode Rsa ( Rivest Shamir Adleman ) Berbasis Web,” Proceeding SENDI_U, vol. 3, no. 3, pp. 14–19, 2017.
A. Sidorenko and B. Schoenmakers, “Concrete security of the blum-blum-shub pseudorandom generator,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 3796 LNCS, pp. 355–375, 2005.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Modifikasi Pembangkit Kunci Algoritma RSA Dengan Menerapkan Algoritma Blum Blum Shub (BBS)
Pages: 39-43
Copyright (c) 2020 Chandra Frenki Sianturi
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
