Kusuma, Raden Teja (2020) Desain Dan Analisis Algoritma Prime Factorization Pada Studi Kasus SPOJ SQFFACT - Square-free Integers Factorization. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
05111640000012-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 membuat asymmetric key yang terdiri dari public key untuk mengenkripsi data dan private key untuk mendeskripsi data. Skema keamanan seperti RSA Algorithm membutuhkan prime factorization dalam proses yang dilakukan sehingga bisa menghasilkan public key dan private key.
Dalam tugas akhir ini, akan dibahas mengenai cara penyelesaian prime factorization sebuah bilangan jika diketahui nilai euler’s totient dari bilangan tersebut dengan menggunakan Carmichael’s function, Euler’s theorem, dan Euler’s totient function yang disusun kedalam randomized algorithm.
Hasil dari tugas akhir ini telah berhasil menyelesaikan permasalahan yang diberikan dengan cukup efisien, dengan rata-rata waktu penyelesaian dalam 10 kali uji coba adalah 0,616 detik dengan penggunaan memori 56 MB.
=======================================================================================================
Security is one of most important aspect in data exchange through internet. One of data securing method is to crate asymmetric key which consists of public key for data encryption and private key for data decryption. Security scheme such as RSA Algorithm require prime factorization in the process to produce public key and private key.
In this thesis, will discuss how to solve prime factorization of a number if know the Euler’s totient from that number by using Carmichael’s function, Euler’s theorem, and Euler’s totient function arranged into randomized algorithm.
The resut of this thesis have successfully resolved problem quite efficiently,with an average running time of 10 trial is 0.616 seconds with 56 MB of memory usage.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Uncontrolled Keywords: | Carmichael's function, Euler's theorem, Euler's totient function, Prime Factorization, Randomized Algorithm |
| Subjects: | Q Science > QA Mathematics > QA9.58 Algorithms |
| Divisions: | Faculty of Information and Communication Technology > Informatics > 55201-(S1) Undergraduate Thesis |
| Depositing User: | Raden Teja Kusuma |
| Date Deposited: | 04 Aug 2020 08:47 |
| Last Modified: | 10 May 2023 14:52 |
| URI: | http://repository.its.ac.id/id/eprint/76435 |
Actions (login required)
 |
View Item |