Expand description
Π_mod (paper Protocol 5): N is a product of two primes p1 ≡ 3, p2 ≡ 7 (mod 8) with
gcd(N, φ(N)) = 1.
The challenges y_i ∈ Z*_N are derived from the transcript (the only input is N), so the
proof is just r_mod tuples (a, b, x, z):
x⁴ = (−1)^a · w^b · y (mod N) with w = 2^N mod N, and z^N = y (mod N).
Structs§
- ModProof
- Proof:
r_modrepetitions. - ModRep
- One repetition
(a, b, x, z). - ModWitness
- Secret input: the two primes (
p1 ≡ 3,p2 ≡ 7 mod 8).