Analisis Modifikasi Algoritma Kriptografi Klasik Menggunakan Algoritma Blum-Micali Generator

Soeb Aripin(1*), Muhammad Syahrizal(2),


(1) Universitas Budi Darma
(2) Universitas Budi Darma
(*) Corresponding Author

Abstract


Classical cryptography is the science of securing secret messages (plaintext) into disguised messages (ciphertext) in which each character is changed. The process of converting plaintext into ciphertext is called encryption, while the reverse process is called decryption. However, this classical crypto algorithm can still be solved using the Kasiski method, due to the mathematically regular pattern of repeating keywords. Therefore, in order not to be easily solved, another method is needed, namely by modifying the Caesar Cipher and Vigenere Cipher cryptographic algorithms. Therefore, to strengthen the security of the classical cryptography algorithm, it is necessary to carry out a modification process using an algorithm that is able to change the complexity of the encoding by using a randomization algorithm. By including a randomization algorithm, it is considered that it can eliminate the possibility of attackers guessing the results by knowing the algorithm used. The randomization algorithm used is the Blum-Micali Generator algorithm. The purpose of using the Blum-Micali Generator algorithm is that the encryption process is randomized so that the encryption results obtained are more difficult to guess, making it difficult for cryptanalysts to read the message or information

Full Text:

PDF

References


M. K. Harahap, “Analisis Perbandingan Algoritma Kriptografi Klasik Vigenere Cipher Dan One Time Pad,” InfoTekJar (Jurnal Nas. Inform. dan Teknol. Jaringan), vol. 1, no. 1, pp. 61–64, 2016.

E. Endaryono, “Perancangan Simulasi Metode Caesar Cipher Menggunakan Microsoft Excel – Alternatif Media Pembelajaran Kriptografi,” SAP (Susunan Artik. Pendidikan), vol. 4, no. 3, 2020.

M. Ramli, R. Asri, and M. Zarlis, “Implementasi Algoritma Vigenere Subtitusi dengan Shift Indeks Prima,” Semin. Nas. Teknol. Inform., pp. 149–154, 2017.

A. Wijaya, “Modifikasi Algoritma Kriptografi Klasik dengan Implementasi Deterministic Finite Automata melalui Partisi Pesan Asli berdasarkan Kriteria Pesan Bagian,” J. Sci. Appl. Technol., vol. 4, no. 2, p. 133, 2020.

A. Josefin and M. Andersen, “Provably Secure Pseudo-Random Generators,” in A Literary Study, 2013, pp. 1–24.

D. Ariyus, “Pengantar Ilmu Kriptografi Teori, Analisis dan Implementasi.,” in Journal of Chemical Information and Modeling, 2008.

R. Sadikin, Kriptografi Untuk Keamanan Jaringan. Yogyakarta: C.V Andi Offset, 2012.

Jamaludin and Romindo, Kriptografi: Teknik Hybrid Cryptosystem Menggunakan Kombinasi Vigenere Cipher dan RSA. 2020.

D. Rachmawati and A. Candra, “Implementasi Kombinasi Caesar dan Affine Cipher untuk Keamanan Data Teks,” J. Edukasi dan Penelit. Inform., 2015.

A. Amrulloh and E. I. H. Ujianto, “Kriptografi Simetris Menggunakan Algoritma Vigenere Cipher,” J. CoreIT, vol. 5, no. 2, pp. 71–77, 2019.




DOI: http://dx.doi.org/10.30645/j-sakti.v6i1.432

Refbacks

  • There are currently no refbacks.



J-SAKTI (Jurnal Sains Komputer & Informatika)
Published Papers Indexed/Abstracted By:


Jumlah Kunjungan :

View My Stats