This Rust project shows an interactive zero-knowledge proof protocol in which the prover confirms their knowledge of a discrete logarithm (the secret value) to the verifier without disclosing the ...

ECC uses discrete logarithms of elliptic curves to provide its one way function. The ElGamal cryptosystem relies on the difficulty of the discrete log problem which is: Given xa = b mod p find log_x(b ...

The asymmetric cryptography on which so much security on the Internet is based relies on one of two mathematical assumptions to work: that it is impossible, other than through brute force, to ...