Introduction to the discrete logarithm problem and a comparison of symmetric vs asymmetric ciphers
-
Updated
Sep 29, 2022 - TeX
Introduction to the discrete logarithm problem and a comparison of symmetric vs asymmetric ciphers
The Chinese remainder theorem and its application in the Pohlig-Hellman algorithm for solving the discrete logarithm problem.
Diffie-Hellman key exchange and ElGamal cryptosystem. Plus Shanks' algorithm for solving the discrete logarithm problem.
Add a description, image, and links to the discrete-logarithm topic page so that developers can more easily learn about it.
To associate your repository with the discrete-logarithm topic, visit your repo's landing page and select "manage topics."