This problem will implement two discrete logarithm programs that can break Diffie-Hellman at various key strengths.
-
Updated
May 5, 2020 - Go
This problem will implement two discrete logarithm programs that can break Diffie-Hellman at various key strengths.
Add a description, image, and links to the exponentiation topic page so that developers can more easily learn about it.
To associate your repository with the exponentiation topic, visit your repo's landing page and select "manage topics."