Document Management System Menggunakan Kombinasi Algoritma ROT13 dan Algoritma String Matching

Feri Setiawan(1*), F Fauziah(2),

(1) Universitas Nasional
(2) Universitas Nasional
(*) Corresponding Author

Abstract


Technology for document management is really need because it can improve performance both in storage, search and document security. Document management in a manual way can waste time in finding required documents and requiring a lot of space for hardcopy document storage. This study uses a string matching algorithm combined with ROT13 algorithm. String matching algorithm is used to find a file name in database, the file name in database has been encrypted for example plaintext “Kabel Ladder” into chipertext “Xnory Ynqqre”. The steps of string matching algorithm combined with ROT13 algorithm in this study are, word pattern is encrypted and then matched with existing data in database and then a string search in performed using string matching algorithm and produces the data sought. In both algorithm, time and number of matches were tested between pattern and data to show performance of two algorithms using 200 data until 500 data. The result of testing 200 data for search word Tower takes 0.00513 sec and matches 65x, 300 data for search word Tower takes 0.00716 sec and matches 164x, 400 data for search word Tower takes 0.01372 sec and matches 262x and 500 data for search word Tower takes 0.02233 sec and matches 360x. From the test result in this study, the researchers concluded that string matching algorithm combined with ROT13 algoritm, the more data, more time it will take, even though it is still relatively small

Full Text:

PDF

References


I. Ahmad, R. Indra Borman, G. G. Caksana, and J. Fakhrurozi, “Implementasi String Matching Dengan Algoritma Boyer-Moore Untuk Menentukan Tingkat Kemiripan Pada Pengajuan Judul Skripsi/TA Mahasiswa (STUDI KASUS: UNIVERSITAS XYZ),” [Online]. Available: https://doi.org/10.31598.

I. Mulyawati, R. Subagio, and D. Martha, “Implementasi Metode String Matching Untuk Aplikasi Pengarsipan Dokumen (Studi Kasus: Smpn 3 Sumber Kab. Cirebon),” J. Digit, vol. 7, no. 1, pp. 50–61, 2017.

Hendrik, “Kombinasi Algoritma Huffman dan Algoritma ROT 13 Dalam Pengamanan File Docx,” J. Inf. Syst. Res., vol. 2, no. 1, pp. 40–46, 2020.

A. A. Nababan and M. Jannah, “Algoritma String Matching Brute Force Dan Knuth-Morris-Pratt Sebagai Search Engine Berbasis Web Pada Kamus Istilah Jaringan Komputer,” J. Mantik Penusa, vol. 3, no. 2, pp. 87–94, 2019.

A. S. Sumi, P. Purnawansyah, and L. Syafie, “Analisa Penerapan Algoritma Brute Force Dalam Pencocokan String,” Pros. SAKTI (Seminar Ilmu Komput. dan Teknol. Informasi), vol. 3, no. 2, pp. 88–92, 2018, [Online]. Available: http://e-journals.unmul.ac.id/index.php/SAKTI/article/view/1836.

G. F. H. Nainggolan, S. Andryana, and A. Gunaryati, “Pencarian Berita Pada Web Portal Menggunakan Algoritma Brute Force String Matching,” JIPI (Jurnal Ilm. Penelit. dan Pembelajaran Inform., vol. 6, no. 1, pp. 1–10, 2021, doi: 10.29100/jipi.v6i1.1824.

R. M. Aresta, E. W. Pratomo, V. Geraldino, J. D. Santoso, and S. Mulyatun, “Implementasi Multi Enkripsi Rot 13 Pada Symbol Whatsapp,” J. Inf. Syst. Manag., vol. 2, no. 1, pp. 1–5, 2020,

H. N. Buluş, E. Uzun, and A. Doruk, “Comparison of string matching algorithms in web documents,” Int. Sci. Conf., vol. 2, no. November, pp. 279–282, 2017, [Online]. Available: https://erdincuzun.com/wp-content/uploads/download/s5_p256.pdf.

M. Bhagya Sri, R. Bhavsar, and P. Narooka, “String Matching Algorithms,” Int. J. Eng. Comput. Sci., vol. 7, no. 03, pp. 23769–23772, 2018, doi: 10.18535/ijecs/v7i3.19.

A. Afandi et al., “Perbandingan Algoritma Boyer Moore dan Algoritma Brute Force pada Aplikasi Hadits Berbasis Android,” vol. 2, no. 1, pp. 1–2, 2017, doi: 10.15575/join.




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

Refbacks

  • There are currently no refbacks.


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

Jumlah Kunjungan :

View My Stats