Functionsยง
- generate_
challenge - challenge generation using Fiat-Shamir heuristic
- generate_
commitment - commitment generation: computes t = g^r % p
- generate_
response - response generation: computes s = (r + c * x) % (p-1)
- mod_exp
- modular exponentiation: computes base^exp % modulus
- verify_
proof - verifies the proof: checks if g^s % p == t * y^c % p