Statistical analysis of pollard's rho attack on elliptic curve cryptography = analisa statistik dari serangan pollard's rho untuk kriptografi kurva eliptik

Josodipuro, Madeleine Jose (2020) Statistical analysis of pollard's rho attack on elliptic curve cryptography = analisa statistik dari serangan pollard's rho untuk kriptografi kurva eliptik. Bachelor thesis, Universitas Pelita Harapan.

[img] Text (Title)
Title.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (818kB)
[img]
Preview
Text (Abstract)
Abstract.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (275kB) | Preview
[img]
Preview
Text (ToC)
ToC.pdf
Available under License Creative Commons Attribution Share Alike.

Download (360kB) | Preview
[img]
Preview
Text (Chapter1)
Chapter1.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (272kB) | Preview
[img] Text (Chapter2)
Chapter2.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (394kB)
[img] Text (Chapter3)
Chapter3.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (383kB)
[img] Text (Chapter4)
Chapter4.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (370kB)
[img] Text (Chapter5)
Chapter5.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (389kB)
[img] Text (Chapter6)
Chapter6.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (222kB)
[img]
Preview
Text (Bibliography)
Bibliography.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (328kB) | Preview
[img] Text (Appendices)
Appendices.pdf
Restricted to Repository staff only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (328kB)

Abstract

Elliptic curve cryptography is a relatively new public-key cryptography mechanism which has been becoming more popular in recent years. With its ability to provide the same level of security as its predecessor, the RSA, with a shorter key length, it is no wonder that its usage has been increasing in various fields using different cryptographic protocols, such as Elliptic Curve Diffie-Hellman (ECDH), Elliptic Curve Digital Signature Algorithm (ECDSA) and the ElGamal encryption scheme. Several attacks have been developed to solve the elliptic curve discrete logarithm problem. These attacks can be categorised into side-channel, special-purpose and general-purpose attacks. One of the most practical generic attacks is the Pollard's Rho algorithm, which originates as an algorithm for prime factorisation. Many studies have proposed on how to improve this algorithm through different methods. This thesis will also attempt to provide a statistical insight on how various factors, namely the private-public key pairs and parameters within the sequence used in Pollard's Rho algorithm, may affect the performance speed of the algorithm. This will be done using the ANOVA statistical test. / Kriptografi kurva eliptik adalah mekanisme kriptografi kunci publik yang relatif baru dan telah menjadi lebih populer dalam beberapa tahun terakhir. Dengan kemampuannya untuk memberikan tingkat keamanan yang sama dengan pendahulunya, RSA, dengan panjang kunci yang lebih pendek, tidak mengherankan bahwa penggunaannya telah meningkat di berbagai bidang menggunakan protokol kriptografi berbeda, seperti Elliptic Curve Diffie-Hellman (ECDH), Elliptic Curve Digital Signature Algorithm (ECDSA) dan skema enkripsi ElGamal. Beberapa serangan telah dikembangkan untuk memecahkan masalah logaritma diskrit kurva eliptik. Serangan-serangan ini dapat dikategorikan ke dalam serangan side-channel, tujuan khusus dan tujuan umum. Salah satu serangan generik yang praktis adalah algoritma Pollard's Rho, yang berasal sebagai algoritma untuk faktorisasi prima. Banyak penelitian telah mengusulkan cara memperbaguskan algoritma ini melalui metode yang berbeda. Skripsi ini juga akan berusaha untuk memberikan wawasan statistik tentang bagaimana berbagai faktor, yaitu pasangan kunci privat-publik dan parameter dalam barisan yang digunakan dalam algoritma Pollard's Rho, dapat mempengaruhi kecepatan kinerja algoritma ini. Ini akan dilakukan dengan menggunakan uji statistik ANOVA.

Item Type: Thesis (Bachelor)
Creators:
CreatorsNIMEmail
Josodipuro, Madeleine JoseNIM00000011802UNSPECIFIED
Contributors:
ContributionContributorsNIDN/NIDKEmail
Thesis advisorLukas, SamuelNIDN0331076001UNSPECIFIED
Thesis advisorSaputra, Kie Van IvankyNIDN0401038203UNSPECIFIED
Additional Information: SK 82-16 JOS s
Uncontrolled Keywords: elliptic curves; elliptic curve cryptography; public-key cryptography; discrete logarithm problem; Pollard's Rho algorithm; ANOVA
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: University Subject > Current > Faculty/School - UPH Karawaci > School of Information Science and Technology > Informatics
Current > Faculty/School - UPH Karawaci > School of Information Science and Technology > Informatics
Depositing User: MADELEINE JOSE JOSODIPURO
Date Deposited: 31 Jan 2020 02:17
Last Modified: 16 Sep 2021 07:34
URI: http://repository.uph.edu/id/eprint/6512

Actions (login required)

View Item View Item