IMPLEMENTASI ALGORITMA ONE TIME PAD COUPLE LINEAR CONGRUENTIAL GENERATOR DAN RIVEST SHAMIR ADLEMAN - CHINESE REMAINDER THEOREM DALAM PENGAMANAN CODING FILE

Nabila Nurul Anisa Az Zahra, - (2023) IMPLEMENTASI ALGORITMA ONE TIME PAD COUPLE LINEAR CONGRUENTIAL GENERATOR DAN RIVEST SHAMIR ADLEMAN - CHINESE REMAINDER THEOREM DALAM PENGAMANAN CODING FILE. S1 thesis, Universitas Pendidikan Indonesia.

[img] Text
S_MAT_1906249_Title.pdf

Download (417kB)
[img] Text
S_MAT_1906249_Chapter1.pdf

Download (181kB)
[img] Text
S_MAT_1906249_Chapter2.pdf
Restricted to Staf Perpustakaan

Download (359kB)
[img] Text
S_MAT_1906249_Chapter3.pdf

Download (238kB)
[img] Text
S_MAT_1906249_Chapter4.pdf
Restricted to Staf Perpustakaan

Download (537kB)
[img] Text
S_MAT_1906249_Chapter5.pdf

Download (95kB)
[img] Text
S_MAT_1906249_Appendix.pdf
Restricted to Staf Perpustakaan

Download (131kB)
Official URL: http://repository.upi.edu

Abstract

Seiring dengan perkembangan jaman, media untuk berkomunikasi ikut mengalami perkembangan. Komunikasi dapat dilakukan di mana pun dengan memanfaatkan perkembangan digital seperti WhatsApp, Line dan E-mail. Bentuk pesan yang dikirim pun ada berbagai macam. Salah satunya adalah coding file yang umumnya digunakan pada bidang IT khususnya oleh programmer. Pengiriman coding file menggunakan server publik dapat beresiko karena file yang dikirim dapat diretas. Kriptografi mampu untuk menyandikan pesan agar pesan yang dikirim menjadi teramankan. Pada penelitian ini diambil algoritma One Time Pad (OTP) dan Rivest Shamir Adleman (RSA) untuk digabungkan dengan tujuan untuk diimplemetasikan pada pengamanan coding file dan dibuat sebuah aplikasi menggunakan algoritma yang telah dipilih. OTP dimodifikasi menggunakan Couple Linear Congurential Generator (CLCG) untuk pembangkitkan kunci OTP dan RSA dimodifikasi menggunakan Chinese Remainder Theorem (CRT) untuk mempersingkat proses pengembalian isi pesan. Kunci OTP CLCG dipilih oleh kedua belah pihak sedangkan RSA publik dan privat RSA CRT dipilih oleh penerima file. Proses enkripsi menggunakan algoritma OTP CLCG, lalu dilanjutnya dengan algoritma RSA. Untuk mengembalikan isi konten file, file terenkripsi didekripsi menggunakan algoritma RSA CRT, lalu dilanjutkan dengan OTP CLCG. Python dipilih untuk mengkonstruksi aplikasi karena merupakan bahasa pemrograman bersifat open source yang mudah dipahami. Aplikasi pengamanan coding file dikonstruksi menggunakan library math dan Tkinter. Along with the development of the era, the media for communication also experienced development. Communication can be done anywhere by utilizing digital developments such as WhatsApp, Line and E-mail. There are various forms of messages. One of them is coding files which are generally used in information and technology’s field, especially by programmer. Delivering coding file using public server can be risky because the sending file can be hacked. Cryptography is able to encode messages so that the messages sent are secured. In this study, the algorithm of One Time Pad (OTP) and Rivest Shamir Adleman is combined for the purpose of securing coding file and made an application based on the selected algorithm. OTP is modified using Couple Linear Congurential Generator (CLCG) to generate the OTP key and RSA is modified using Chinese Remainder Theorem (CRT) to reducing the time for the decryption process. The CLCG OTP key is chosen by both parties while the public RSA and private RSA CRT are chosen by the file's recipient. The encryption process use OTP's algorithm then followed by RSA's algorithm. In order to return the file’s contents, the encrypted gile is decrypted using RSA CRT's algorithm then followed by OTP CLCG's algorithm. Python was chosen to construct the application because it is an open source programming language that is easy to understand. The coding file security's application is constructed by using math and tkinter's library.

Item Type: Thesis (S1)
Additional Information: ID SINTA Dosen Pembimbing: Rini Marwati: 5981279 Ririn Sispiyati: 5986406
Uncontrolled Keywords: Kriptografi, One Time Pad, Couple Linear Congurential Generator, Rivest Shamir Adleman, Chinese Remainder Theorem, Coding file
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Jurusan Pendidikan Matematika > Program Studi Matematika (non kependidikan)
Depositing User: Nabila Nurul Anisa Az Zahra
Date Deposited: 05 Sep 2023 02:33
Last Modified: 05 Sep 2023 02:33
URI: http://repository.upi.edu/id/eprint/101362

Actions (login required)

View Item View Item