Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Use superscript for exponent #42

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Use superscript for exponent #42

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion key-exchange/diffie-hellman-key-exchange.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -64,7 +64,7 @@ there is no efficient \(fast\) algorithm to find the secret exponent **s**. This

The **Discrete Logarithm Problem \(DLP\)** in computer science is defined as follows:

* By given element _**b**_ and value _**a**_ = _**bx**_ find the exponent _**x**_ \(if it exists\)
* By given element _**b**_ and value _**a**_ = _**b<sup>x<sup>**_ find the exponent _**x**_ \(if it exists\)

The exponent _**x**_ is called [**discrete logarithm**](https://en.wikipedia.org/wiki/Discrete_logarithm), i.e. **x** = _log_**b**\(**a**\). The elements _**a**_ and _**b**_ can be simple integers modulo _**p**_ \(from the [group ℤ/pℤ](https://en.wikipedia.org/wiki/Multiplicative_group_of_integers_modulo_n)\) or elements of [finite cyclic multiplicative group **G**](https://en.wikipedia.org/wiki/Cyclic_group) \(modulo _**p**_\), where _**p**_ is typically a prime number.

Expand Down