Overview

This is a simple Rust implementation of the Chaum-Pedersen protocol for proving/verifying knowledge of a discrete logarithm ($x \in \mathbb{F}$ s.t. $g^x = k$, $g, k \in \mathbb{F}$).