An implementation of Shank's (BSGS) algorithm on a toy elliptic curve
-
Updated
Dec 28, 2022 - C++
An implementation of Shank's (BSGS) algorithm on a toy elliptic curve
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.
Script for the use of lightweight databases focused on public keys and BSGS, to reduce the use of disk and ram space.
Baby Step Giant Step algorithm implemented in python3. With complexity nlog(n)
A CUDA based sieve for numbers of the form k*b^n-1. This project is heavily based on SR2Sieve.
Ahtapot BSGS, Kurulum ve konfigurasyon dökümanları
34 000 Satoshi Nakamoto wallets with pubkeys (50 BTC each other)
Python3 implementation of Cryptographic attacks. Applcations examples introduced on my blog.
privkey hunt for crypto currencies that use secp256k1 elliptic curve
Add a description, image, and links to the bsgs topic page so that developers can more easily learn about it.
To associate your repository with the bsgs topic, visit your repo's landing page and select "manage topics."