Module schnorr 

Schnorr proof of knowledge — non-interactive ZK proof of discrete log.

Proves knowledge of x such that Y = g^x, without revealing x. Uses the Fiat-Shamir heuristic: the challenge is derived from a hash of the protocol transcript, making the proof non-interactive.

Structs

SchnorrProof

A Schnorr proof: (R, z) serialized as hex strings.

Enums

SchnorrError

Errors during proof operations.

Functions

prove

Create a Schnorr proof of knowledge of the discrete log of public.

verify

Verify a Schnorr proof.