Tirtajiwangga, Taufiq (2020) Perbandingan Kinerja Algoritma Baby-Step Giant-Step dan Pohlig-Hellman sebagai Metode Penyelesaian Logaritma Diskrit dengan Modulus Bilangan Prima: Studi Kasus URI Online Judge 2711 Unlocking A Cell Phone. Other thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
05111640000016-Undergraduate_Thesis.pdf Download (839kB) | Preview |
Preview |
Text
05111640000016-Undergraduate_Thesis.pdf Download (1MB) | Preview |
Abstract
Keamanan adalah salah satu aspek terpenting dalam pertukaran data melalui jaringan internet. Salah satu contoh metode pengamanan data adalah dengan membuat asymmetric key yang terdiri dari public key untuk mengenkripsi data dan private key untuk mendekripsi data. Beberapa skema keamanan seperti ElGamal Encryption dan Digital Signature Algorithm menggunakan public key dan private key yang dibuat berdasarkan logaritma diskrit dengan memanfaatkan kemudahan melakukan dekripsi data menggunakan private key dan operasi pemangkatan modular. Namun demikian, tetaplah sulit untuk mengetahui private key bila yang diketahui hanyalah public key. Dalam Tugas Akhir ini dibahas mengenai kinerja penyelesaian permasalahan logaritma diskrit menggunakan algoritma Baby-Step Giant-Step dan Pohlig-Hellman untuk mendapatkan private key berdasarkan public key yang diketahui. Dari hasil uji coba pada studi kasus yang digunakan, didapatkan hasil bahwa algoritma Pohlig-Hellman dengan rata-rata running time maksimal 3,195 ± 0,720 ms memiliki kinerja yang lebih baik dibandingkan algoritma Baby-Step Giant-Step dengan rata-rata running time maksimal 17,709 ± 1,021 ms.
=================================================================================================================================
Security is one of most important aspect in data exchange through internet. One of data securing method is to create asymmetric key which consists of public key for data encryption and private key for data decryption. Security schemes like ElGamal Encryption and Digital Signature Algorithm have used public key and private key which have been built based on discrete logarithm that utilise the ease of data decryption by using private key and modular exponentiation operation. However, it is difficult to retrieve private key if only public key has been known. This thesis investigated the performance of Baby-Step Giant-Step and Pohlig-Hellman algorithm for solving the discrete logarithm problem. Based on the result of the given case study, it can be shown that the performance of Pohlig-Hellman algorithm with maximum average running time 3.195 ± 0.720 ms is better than Baby-Step Giant-Step algorithm with maximum average running time 17.709 ± 1.021 ms.
| Item Type: | Thesis (Other) |
|---|---|
| Additional Information: | RSIf 005.1 Tir p-1 2024 |
| Uncontrolled Keywords: | Baby-Step Giant-Step, Logaritma Diskrit, Pohlig-Hellman |
| Subjects: | Q Science > QA Mathematics > QA76.6 Computer programming. Q Science > QA Mathematics > QA76.9.A25 Computer security. Digital forensic. Data encryption (Computer science) Q Science > QA Mathematics > QA9.58 Algorithms T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5105.546 Computer algorithms |
| Divisions: | Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis |
| Depositing User: | Taufiq Tirtajiwangga |
| Date Deposited: | 11 Mar 2025 02:35 |
| Last Modified: | 11 Mar 2025 02:35 |
| URI: | http://repository.its.ac.id/id/eprint/73172 |
Actions (login required)
 |
View Item |