This is the final phase of solving DLPs. Our goal is to convert a big integer into a product of small prime numbers over out factor base. We use a sieve.
-
Updated
May 26, 2026 - C++
#
discrete-logarithm-problem
Here are 2 public repositories matching this topic...
Computation of Discrete Logarithms in Prime Fields (Gaussian Integers Method extended to Eisenstein Integers Method)
complex-numbers discrete-logarithm eisenstein-numbers index-calculus discrete-logarithms gaussian-integers discrete-logarithm-problem
-
Updated
Dec 10, 2025 - Jupyter Notebook
Improve this page
Add a description, image, and links to the discrete-logarithm-problem topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the discrete-logarithm-problem topic, visit your repo's landing page and select "manage topics."