Perbandingan Kinerja Metode Baby-step Giant-step dan Pollard Rho dengan Brent Cycle Detection sebagai Metode Penyelesaian Permasalahan Logaritma Diskret: Studi Kasus Persoalan "DSA Attack" Pada Timus Online Judge

Ghazian, Muhammad (2018) Perbandingan Kinerja Metode Baby-step Giant-step dan Pollard Rho dengan Brent Cycle Detection sebagai Metode Penyelesaian Permasalahan Logaritma Diskret: Studi Kasus Persoalan "DSA Attack" Pada Timus Online Judge. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.

[img]
Preview
Text
05111440000158-Undergraduate_Theses.pdf - Accepted Version

Download (5MB) | Preview

Abstract

Permasalahan logaritma diskret merupakan permasalahan yang sulit untuk diselesaikan. Pada dunia kriptografi, hal ini sering dimanfaatkan untuk mengamankan subjek sekuritas. Banyak studi telah dilakukan terkait topik logaritma diskret, dan dari studi tersebut dihasilkan banyak metode untuk menyelesaikan permasalahan tersebut. Tugas akhir ini mengulas dua metode tersebut, yaitu metode Baby-step Giant-step dan Pollard Rho dengan varian Brent Cycle Detection. Melalui pengujian dan studi kasus, didapat hasil bahwa kedua metode memiliki fungsi pertumbuhan yang relatif sama, namun waktu yang dibutuhkan oleh Baby-step Giant-step untuk menyelesaikan permasalahan lebih stabil dibandingkan Pollard Rho. ====================================================================================================== Discrete logarithm problem is a difficult task to solve. In cryptography, the hardness nature of discrete logarithm is utilized as a mean to improve security. A numerous study has been undertaken regarding discrete logarithm problem, and from which, a handful of method has been constructed to solve such problem. This thesis reviews two methods to solve discrete logarithm problem, namely Baby-step Giant-step and Pollard Rho with Brent Cycle Detection variant. According to subsequent testing and case study, it appears that both method have relatively similar growth function. Baby-step Giant-step's running time, however, is much more stable compared to Pollard Rho.

Item Type: Thesis (Undergraduate)
Uncontrolled Keywords: baby-step giant-step; pollard rho; brent; logaritma diskret; teori bilangan; kriptografi;
Subjects: Q Science > QA Mathematics > QA76.9.A25 Computer security. Digital forensic. Data encryption (Computer science)
Divisions: Faculty of Information and Communication Technology > Information Systems > 57201-(S1) Undergraduate Thesis
Depositing User: Muhammad Ghazian
Date Deposited: 06 Jan 2021 22:10
Last Modified: 06 Jan 2021 22:10
URI: https://repository.its.ac.id/id/eprint/53866

Actions (login required)

View Item View Item