Freaks City

BSGS Algorithm The Baby-step Giant-step (BSGS) algorithm solves discrete logarithm problems of the form \(a^x \equiv n \pmod{p}\) for the smallest non-negative integer \(x\), where \(a\) and \(p\) are coprime constants. Algorithm Overview Express \(x\) as \(x = A \cdot \lceil \sqrt{p} \rceil - B\) where \(0 \leq A, B \leq \lceil \sqrt{p} \rceil ...