This repository contains an algorithm for solving the discrete logarithm. It is efficient if the multiplicative order is a smooth number, making it an alternative to the Pohlig-Hellman algorithm ...

The Baby Step Giant Step algorithm and the Pohlig-Hellman algorithm are two popular algorithms used for solving the discrete logarithm problem in elliptic curve cryptography. ... You can then import ...