Baby-Step Giant-Step Discrete Logarithm Problem Solver in WebAssembly (Written in Rust)
-
Updated
Nov 4, 2020 - Rust
Baby-Step Giant-Step Discrete Logarithm Problem Solver in WebAssembly (Written in Rust)
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.
A repo that contains implementation of classic cryptographic problems.
Final Year Project 2016 http://www.indjst.org/index.php/indjst/article/view/102112
Finding a discrete logarithm (C++, Windows).
Implementation of Elliptic Curve / Finite Body in Rust
Classical Cryptosystems, Grain Cipher, RSA and it's attacks, RC4, Toy Cipher(based on SPN) Hash Function and their cryptoanalysis
An implementation of Shank's (BSGS) algorithm on a toy elliptic curve
An algorithm for solving the discrete logarithm
Implementation of some basic algorithms relevant for cryptography.
[CS 101 - IIT Bombay] A tiny cryptography application written in C++
Diffie-Hellman key exchange and ElGamal cryptosystem. Plus Shanks' algorithm for solving the discrete logarithm problem.
Solving a two variable modulo function using the algorithm for discrete lograithm
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.
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.
Implementation of the baby-step, giant-step algorithm for finding discrete logarithms
Hyper-Complex large numbers.
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."