#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/16371 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | 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. |
|---|