Perbandingan kinerja faktorisasi bilangan bulat antara komputer klasik dengan komputer kuantum

Montalfu, Felix (2022) Perbandingan kinerja faktorisasi bilangan bulat antara komputer klasik dengan komputer kuantum. Bachelor thesis, Universitas Pelita Harapan.

Preview	Text (Title) Title.pdf Available under License Creative Commons Attribution Non-commercial Share Alike. Download (95kB) | Preview
	Text (Abstract) Abstract.pdf Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial Share Alike. Download (583kB)
	Text (ToC) ToC.pdf Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial Share Alike. Download (720kB)
	Text (Chapter1) Chapter1.pdf Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial Share Alike. Download (565kB)
	Text (Chapter2) Chapter2.pdf Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial Share Alike. Download (5MB)
	Text (Chapter3) Chapter3.pdf Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial Share Alike. Download (889kB)
	Text (Chapter4) Chapter4.pdf Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial Share Alike. Download (672kB)
	Text (Chapter5) Chapter5.pdf Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial Share Alike. Download (265kB)
	Text (Bibliography) Bibliography.pdf Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial Share Alike. Download (799kB)
	Text (Appendices) 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.

Actions (login required)

View Item