bsgs
Here are 12 public repositories matching this topic...
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.
-
Updated
Jun 8, 2017 - C++
Python3 implementation of Cryptographic attacks. Applcations examples introduced on my blog.
-
Updated
Apr 20, 2018 - Python
Baby Step Giant Step algorithm implemented in python3. With complexity nlog(n)
-
Updated
Jun 6, 2018 - Python
Ahtapot BSGS, Kurulum ve konfigurasyon dökümanları
-
Updated
May 27, 2022
An implementation of Shank's (BSGS) algorithm on a toy elliptic curve
-
Updated
Dec 28, 2022 - C++
Script for the use of lightweight databases focused on public keys and BSGS, to reduce the use of disk and ram space.
-
Updated
Dec 11, 2023 - Python
A CUDA based sieve for numbers of the form k*b^n-1. This project is heavily based on SR2Sieve.
-
Updated
Jun 29, 2024 - Cuda
privkey hunt for crypto currencies that use secp256k1 elliptic curve
-
Updated
Aug 18, 2024 - C++
Private_key_search is using BSGs algorithm to discover the private key
-
Updated
Sep 6, 2024 - TypeScript
Improve this page
Add a description, image, and links to the bsgs topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the bsgs topic, visit your repo's landing page and select "manage topics."