Algorithms for discret logarithm problem
-
Updated
Apr 11, 2016 - Python
Algorithms for discret logarithm problem
Different Flavors of the Schnorr signature.
Hyper-Complex large numbers.
Implementation of the baby-step, giant-step algorithm for finding discrete logarithms
Used algorithms for prime generation/check (Fermat's test and Miler Rabin's test) to implement discrete logarithm (BSGS), and inverse and exponentiation (Extended Euclid's algorithm). Refer to readme.txt for more details.
Final Year Project 2016 http://www.indjst.org/index.php/indjst/article/view/102112
[CS 101 - IIT Bombay] A tiny cryptography application written in C++
My implementations of the solutions of Cryptopals problems from the hardest set i.e. set 8
Zero_Knowledge-proof demonstration using discrete log. Demonstration of 1-2 oblivious transfer protocol.
Elliptic curve tools, ECDSA, and ECDSA attacks.
Julia package for descent elimination algorithms
python program that implements divide and conquer approach, or Pohlig-Hellman approach, to solving discrete log problems
A repo that contains implementation of classic cryptographic problems.
Repo contains code samples for practical learning of cryptography.
Baby Step Giant Step for SECPK1
Attacks on the Diffie Hellman Key Exchange
Baby-Step Giant-Step Discrete Logarithm Problem Solver in WebAssembly (Written in Rust)
Finding a discrete logarithm (C++, Windows).
Mathematical cryptography (custom implementations).
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."