Analysis of algorithms to solve the discrete logarithm problem
This project aims to explore and understand the concepts of the discrete logarithm problem. Discrete logarithm is a fundamental concept in modern cryptography. The project aims to provide an understanding of the real-world applications employed using discrete logarithm and the various methods used t...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
Nanyang Technological University
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/174285 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | This project aims to explore and understand the concepts of the discrete logarithm problem. Discrete logarithm is a fundamental concept in modern cryptography. The project aims to provide an understanding of the real-world applications employed using discrete logarithm and the various methods used to solving it.
Discrete Logarithm Formula is defined as:
g^x = h (mod p)
Where g is a fixed base value, x is the unknown exponent, p is a prime number and h is the result of raising the base g to the exponent x and taking the result modulo p.
From the equation, we would want to find the value of the exponent x, given values of g, h and p. The discrete logarithm problem is a computationally hard problem and is used to be the basis of constructing a secure cryptosystem. Cryptography plays a crucial role in ensuring confidentiality and security of data. |
|---|