#TITLE_ALTERNATIVE#
In 2005, National Security Agency in United States (NSA) recommends the use of Elliptic Curve Cryptography (ECC) as the basis for all cryptographic algorithms. ECC is very efficient because it needs smaller key than other cryptosystems for the same security level. The security of ECC depends on how...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/16370 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:16370 |
|---|---|
| spelling |
id-itb.:163702017-09-27T11:42:59Z#TITLE_ALTERNATIVE# SAPUTRA (NIM : 10108109) ; Pembimbing : Dr. Muchtadi Intan Detiena, MARIO Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/16370 In 2005, National Security Agency in United States (NSA) recommends the use of Elliptic Curve Cryptography (ECC) as the basis for all cryptographic algorithms. ECC is very efficient because it needs smaller key than other cryptosystems for the same security level. The security of ECC depends on how to solve Elliptic Curve Discrete Logarithm Problem (ECDLP). And the best algorithm to solve the ECDLP is Pollard Rho. Even so, the original Pollard Rho Algorithm is still not efficient enough. Pollard Rho uses iteration function to produce a random walk. But to make the algorithm more efficent, the iteration function should produce random random walk. In this work, we will explain Pollard Rho Algorithm and its modification on Elliptic Curve Cryptography. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
In 2005, National Security Agency in United States (NSA) recommends the use of Elliptic Curve Cryptography (ECC) as the basis for all cryptographic algorithms. ECC is very efficient because it needs smaller key than other cryptosystems for the same security level. The security of ECC depends on how to solve Elliptic Curve Discrete Logarithm Problem (ECDLP). And the best algorithm to solve the ECDLP is Pollard Rho. Even so, the original Pollard Rho Algorithm is still not efficient enough. Pollard Rho uses iteration function to produce a random walk. But to make the algorithm more efficent, the iteration function should produce random random walk. In this work, we will explain Pollard Rho Algorithm and its modification on Elliptic Curve Cryptography. |
| format |
Final Project |
| author |
SAPUTRA (NIM : 10108109) ; Pembimbing : Dr. Muchtadi Intan Detiena, MARIO |
| spellingShingle |
SAPUTRA (NIM : 10108109) ; Pembimbing : Dr. Muchtadi Intan Detiena, MARIO #TITLE_ALTERNATIVE# |
| author_facet |
SAPUTRA (NIM : 10108109) ; Pembimbing : Dr. Muchtadi Intan Detiena, MARIO |
| author_sort |
SAPUTRA (NIM : 10108109) ; Pembimbing : Dr. Muchtadi Intan Detiena, MARIO |
| title |
#TITLE_ALTERNATIVE# |
| title_short |
#TITLE_ALTERNATIVE# |
| title_full |
#TITLE_ALTERNATIVE# |
| title_fullStr |
#TITLE_ALTERNATIVE# |
| title_full_unstemmed |
#TITLE_ALTERNATIVE# |
| title_sort |
#title_alternative# |
| url |
https://digilib.itb.ac.id/gdl/view/16370 |
| _version_ |
1820745359097331712 |