Desain Dan Analisis Algoritma Prime Factorization Dan Primality Test Pada Studi Kasus Beecrowd 2145 – The Love Life Of The Numbers

Sutanto, Jonathan Alphabert (2023) Desain Dan Analisis Algoritma Prime Factorization Dan Primality Test Pada Studi Kasus Beecrowd 2145 – The Love Life Of The Numbers. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 05111740000053-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 April 2025. Download (2MB) | Request a copy

Abstract

Dalam dunia teori bilangan, integer factorization adalah proses dekomposisi dari sebuah bilangan menjadi hasil perkalian dari bilangan yang lebih kecil. Sedangkan integer factorization yang menghasilkan dekomposisi berupa bilangan prima disebut dengan prime factorization. Dalam dunia kriptografi, khususnya public key encryption RSA(Rivest-Shamir Adleman) encryption menggunakan bilangan yang dibentuk dari dua bilangan prima. Topik tugas akhir ini mengulas bagaimana cara penggunaan integer factorization algorithm yaitu algoritma Pollard-rho dan juga primality test algorithm yaitu Miller-Rabin primality test untuk mendapatkan faktor faktor prima dari sebuah bilangan dan mendapatkan restricted divisor function dari sebuah bilangan. Restricted divisor function adalah fungsi penjumlahan dari semua faktor dari sebuah bilangan tanpa melibatkan bilangan tersebut. Tugas akhir ini berhasil menyelesaikan permasalahan di atas dengan waktu eksekusi mendekati 0.000s.
===================================================================================================================================
In number theory, integer factorization is decomposition process from a number become a multiplication with smaller numbers. Meanwhile, decomposition process that resulted with only prime number called prime factorization. In cryptography, public key encryption RSA(Rivest-Shamir Adleman) encryption using two numbers of prime numbers. The topics of the thesis discussed how to use Pollard-rho algorithm for integer factorization and also primality test using Miller-Rabin algorithm to find prime factor from a number and find the restricted divisor function from a number. Restricted divisor function is function that return all the sum of factor from a number except their number. This thesis is successful in solving above problems with the execution time of Pollard-rho and Miller Rabin an average time of 0.00 second.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	bilangan prima, integer factorization, primality test, restricted divisor function, integer factorization, primality test, prime number, restricted divisor function
Subjects:	T Technology > T Technology (General) > T57.5 Data Processing T Technology > T Technology (General) > T57.6 Operations research--Mathematics. Goal programming
Divisions:	Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis
Depositing User:	Jonathan Alphabert Sutanto
Date Deposited:	11 Feb 2023 09:06
Last Modified:	11 Feb 2023 09:06
URI:	http://repository.its.ac.id/id/eprint/96354

Actions (login required)

View Item