Baby Step Giant Step for SECPK1
-
Updated
Apr 20, 2020 - C++
Baby Step Giant Step for SECPK1
elliptic curve cryptography with GPU acceleration
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.
Finding a discrete logarithm (C++, Windows).
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
[CS 101 - IIT Bombay] A tiny cryptography application written in C++
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."