Montalfu, Felix (2022) Perbandingan kinerja faktorisasi bilangan bulat antara komputer klasik dengan komputer kuantum. Bachelor thesis, Universitas Pelita Harapan.
Preview
Title.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (95kB) | Preview
![Abstract [thumbnail of Abstract]](http://repository.uph.edu/style/images/fileicons/text.png)
Abstract.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (583kB)
![ToC [thumbnail of ToC]](http://repository.uph.edu/style/images/fileicons/text.png)
ToC.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (720kB)
![Chapter1 [thumbnail of Chapter1]](http://repository.uph.edu/style/images/fileicons/text.png)
Chapter1.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (565kB)
![Chapter2 [thumbnail of Chapter2]](http://repository.uph.edu/style/images/fileicons/text.png)
Chapter2.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (5MB)
![Chapter3 [thumbnail of Chapter3]](http://repository.uph.edu/style/images/fileicons/text.png)
Chapter3.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (889kB)
![Chapter4 [thumbnail of Chapter4]](http://repository.uph.edu/style/images/fileicons/text.png)
Chapter4.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (672kB)
![Chapter5 [thumbnail of Chapter5]](http://repository.uph.edu/style/images/fileicons/text.png)
Chapter5.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (265kB)
![Bibliography [thumbnail of Bibliography]](http://repository.uph.edu/style/images/fileicons/text.png)
Bibliography.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (799kB)
![Appendices [thumbnail of Appendices]](http://repository.uph.edu/style/images/fileicons/text.png)
Appendices.pdf
Restricted to Repository staff only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (35MB)
Abstract
Faktorisasi bilangan bulat merupakan masalah komputasi yang sedang menjadi pembahasan hangat pada topik kriptografi dan komputasi kuantum, yang dimana komputasi kuantum sudah dapat memfaktorkan bilangan bulat dengan angka 15 secara praktikal. Akan tetapi adanya batasan perangkat keras dari komputasi klasikal dan sedang berkembangnya teknologi komputasi kuantum dari sisi perangkat keras dan algoritme kuantum, komputasi kuantum menjanjikan penambahan kecepatan eksponensial dari masalah praktikal komputasi klasikal salah satu masalah praktikal tersebut adalah faktorisasi bilangan bulat. Faktorisasi bilangan bulat dengan komputasi klasikal berhasil memfaktorkan bilangan RSA-250 yang memiliki jumlah digit sebanyak 232 digit yang memerlukan lebih kurang 2700 tahun inti (core years) menggunakan prosesor Intel Xeon Gold 6130 sebagai pedoman. Sedangkan untuk pemfaktoran dengan komputasi kuantum berhasil memfaktorkan angka bulat 21 dengan algoritme Shor’s dikarenakan adanya batasan perangkat keras pada komputer kuantum sehingga pemfaktoran dengan algoritme Shor’s hanya efektif ≤60./Integer factorization is a computational problem that is currently a hot topic of discussion among cryptography and quantum computing, where quantum computing can practically factorize integer with number equals to 15. However, due to the limitation of classical computing and the development of quantum computing technology in term of hardware and quantum algorithm, quantum computing promises to increase speed in exponential degree from practical problem of classical computing. One of these practical problems is integer factorization. Integer factorization with classical computing succeeded in factoring RSA-250 numbers which have a total of 232 digits which requires approximately 2700 core years using an Intel Xeon Gold 6130 processor as a reference. As for factoring with quantum computing, it is successful to factor the integer 21 with Shor's algorithm due to hardware limitations on the quantum computer so factoring with Shor's algorithm is only effective 60.
Item Type: | Thesis (Bachelor) |
---|---|
Creators: | Creators NIM Email ORCID Montalfu, Felix NIM03082180055 felix.montalfu@gmail.com UNSPECIFIED |
Contributors: | Contribution Contributors NIDN/NIDK Email Thesis advisor Chandra, Wenripin NIDN0116088001 wenripin@lecturer.uph.edu |
Uncontrolled Keywords: | faktorisasi; teori bilangan; komputasi kuantum; informasi kuantum; RSA; algoritme; Shor’s; Yet Another Factoring Utility; YAFU |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | University Subject > Current > Faculty/School - UPH Medan > School of Information Science and Technology > Informatics Current > Faculty/School - UPH Medan > School of Information Science and Technology > Informatics |
Depositing User: | Users 24149 not found. |
Date Deposited: | 19 Aug 2022 08:16 |
Last Modified: | 25 Aug 2022 05:53 |
URI: | http://repository.uph.edu/id/eprint/49745 |