Penerapan Multiply With Carry Generator pada Proses Pembangkitan Kunci Algoritma Beaufort Cipher
-
Taronisokhi Zebua
*
Universitas Budi Darma, Medan,
Indonesia
(*) Corresponding Author
Abstract
The strength of the algorithm used in data security does not only depend on the complexity of the algorithm used, but lies in the randomness and complexity of the key solving used. The repetition of the same character in the formation of a key used by a data security algorithm is very vulnerable to attack, because it can make it easier for attackers to break the algorithm itself. One of the commonly used data security algorithms is the comfort cipher algorithm. The number of key characters needed in this algorithm is directly proportional to or equal to the number of characters of text or data that is secured. Using a number of key characters like this allows the repetition of the same characters, making it easier for attackers to find out the pattern of the keywords used. Based on this, random key generation is necessary to optimize the robustness of the algorithm used. Multiply with carry generator is a random number generation technique that has advantages in speed and length of randomization cycle so that it has more seed variations to the generated random numbers. This study describes how to apply this random number generation method to generate keywords used in the beaufort cipher algorithm, so that the keys used can be more optimal and more complicated for attackers to crack.
Downloads
References
R. K. Hondro, “Modifikasi Platform Kunci Algoritma Playfair Untuk Meningkatkan Nilai Confusion Pada Ciphertext,” Journal of Computer System and Informatics (JoSYC), vol. 1, no. 2, pp. 76-82, 2020.
M. Diana dan T. Zebua, “Optimalisasi Beufort Cipher Menggunakan Pembangkit Kunci RC4 dalam Penyandian SMS,” Jurnal Sains Komputer & Informatika (J-SAKTI), vol. 2, no. 1, pp. 12-22, 2018.
M. Fadlan, S. Sinawati, A. Indriani dan E. D. Bintari, “Pengamanan Data Teks Melalui Perpaduan Algoritma Beaufort Cipher dan Caesar Cipher,” Jurnal Teknik Informatika, vol. 12, no. 2, pp. 149-158, 2019.
R. A. Saputra, I. T. Awalda dan B. Pramono, “Implementasi Algoritma Multiply With Carry Generator (MWCG) dalam Pengacakan Soal Ujian Semester Berbasis Web pada SMKN 1 Kendari,” Jurnal Informatika Universitas Palembang, vol. 7, no. 1, pp. 60-67, 2022.
E. Haryadi dan S. M. Ladjamuddin, “Teknik Keamanan Pesan Menggunakan Kriptografi dengan Algoritma Vernam Cipher,” Incomtech, vol. 6, no. 1, pp. 40-47, 2017.
H. dan M. A. Rony, “Implementasi Keamanan Database Dengan Menggunakan Metode Edvanced Encription Standard pada Sekolah SMK Islam Al Hikmah Jakarta Berbasis Dekstop,” SKANIKA, vol. 8, no. 3, pp. 1137-1142, 2018.
S. “Implemenmtasi Algoritma Kriptografi RSA (Rivest Shamir Adleman) untuk Keamanan Data Rekam Medis Pasien,” INTECOMS, vol. 4, no. 1, pp. 104-114, 2021.
D. H. Pane, “Implementasi Kriptografi Keamanan Data Resi pada PT JNE Perbaungan Menggunakan Metode Markle Hellman,” Journal of Information System, Computer Science and Information Technology, vol. 1, no. 1, pp. 6-10, 2020.
E. Ndruru dan T. Zebua, “Pembangkitan Kunci Beaufort Cipher dengan Teknik Blum-blum Shub pada Pengamanan Citra Digital,” Buletin of Information Technology, vol. 2, no. 2, pp. 149-154, 2022.
A. Lingga, “Analisa Implementasi Aplikasi Keamanan File Audio WAV dengan Menerapkan Algoritma Beaufort Cipher dan ROT 13,” Jurnal Pelita Informatika, vol. 8, no. 1, pp. 33-40, 2019.
A. Rachmadsyah, A. Perdana dan A. Budiman, “Kombinasi Algoritma Beaufort Cipher dan Vigenere Cipher untuk Pengamanan Pesan Teks Berbasis Mobile Aplication,” Jurnal Minfo Polgan, vol. 9, no. 2, pp. 12-17, 2020.
M. D. Irawan, “Implementasi Kriptografi Vigenere Cipher dengan PHP,” E-Journal, vol. 1, no. 1, pp. 127-134, 2017.
K. Paraditasari dan A. D. Wowor, “Desain Pembangkit Kunci Block Cipher Berbasis CSPRNG Chaso Menggunakan Fungsi Trigonometri,” Jurnal Ilmiah Penelitian dan Pembelajaran Informatika, vol. 06, no. 02, p. 400–405, 2021.
HandWiki, “HandWiki,” Multiply-with-carry, 06 March 2021. [Online]. Available: https://handwiki.org/wiki/Multiply-with-carry. [Diakses 14 December 2022].
Y. P. Mulya, R. Latuconsina dan A. S. R. Ansori, “Implementasi Algoritma Multiply With Carry pada Game Panahan,” e-Proceeding of Engineering, vol. 7, no. 1, pp. 40-44, 2020.
M. Goresky dan A. Klapper, “ACM Digital Libary,” 01 October 2018. [Online]. Available: https://dl.acm.org/doi/abs/10.1145/945511.945514. [Diakses 21 December 2022].
W. F. Encyclopedia, “Wikipedia Free Encyclopedia,” Multiply-with-carry pseudorandom number generator, 4 July 2022. [Online]. Available: https://en.wikipedia.org/wiki/Multiply-with-carry_pseudorandom_number_generator. [Diakses 11 December 2022].
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Penerapan Multiply With Carry Generator pada Proses Pembangkitan Kunci Algoritma Beaufort Cipher
Pages: 607-613
Copyright (c) 2023 Taronisokhi Zebua
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).
