#TITLE_ALTERNATIVE#
The security of elliptic curve cryptosystems depends on the difficulty of solving the discrete logarithm problem. Pollard’s rho algorithm is an algorithm that can be used to solve the discrete logarithm problem. However, using the standard variant of Pollard’s rho algorithm takes significant c...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/20569 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | The security of elliptic curve cryptosystems depends on the difficulty of solving the discrete logarithm problem. Pollard’s rho algorithm is an algorithm that can be used to solve the discrete logarithm problem. However, using the standard variant of Pollard’s rho algorithm takes significant computer memory for large curve sizes. This book proposes a modification of Pollard’s rho algorithm using Brent’s cycle detection algorithm, the negation map, and the Frobenius map. In addition, the partition used in the standard variant of Pollard’s rho algorithm is also modified. |
|---|