Struct ToySchnorr 

pub struct ToySchnorr {
    pub p: u64,
    pub q: u64,
    pub g: u64,
}

Toy Schnorr signature scheme over a finite cyclic group Z_p^*.

WARNING

Educational only. Parameters are not secure.

Fields

p: u64

Prime modulus p

q: u64

Group order q (should be a prime divisor of p-1)

g: u64

Generator g of the subgroup of order q

Implementations

impl ToySchnorr

pub fn new(p: u64, q: u64, g: u64) -> Self

Create a Schnorr context.

pub fn public_key(&self, x: u64) -> u64

Compute the public key: g^x mod p.

pub fn sign(&self, x: u64, k: u64, h: u64) -> (u64, u64)

Sign a message hash h with private key x and nonce k.

Returns (r, s) where r = g^k mod p mod q, s = (k - x*r) mod q.

WARNING

Never reuse the nonce k. In practice, k must be uniformly random.

pub fn verify(&self, pk: u64, h: u64, r: u64, s: u64) -> bool

Verify a Schnorr signature (r, s) on hash h with public key pk.

Checks: g^s * pk^h ≡ R and R mod q == r.