feature/GI-11: NIZK Proof of Knowledge of Equal Discrete Logs [Pt. #1]

[qubits4all]

Non-Interactive Zero-Knowledge (NIZK) Proofs of Knowledge (PoKs) of Equal Discrete Logarithms

• [x] Support generation & verification of non-interactive zero-knowledge (NIZK) proofs of knowledge (PoKs) of equal discrete logarithms over elliptic curves (i.e., extending beyond the existing module's NIZK proofs of knowledge of a single discrete log).
• [x] This module will be based on the Chaum-Pedersen interactive protocol, and use the Fiat-Shamir transform to produce a non-interactive ZK proof.
• [x] Add support for generalizing to NIZK proofs of knowledge of equal sets of N discrete logarithms (with N > 2).
• [x] Include support for serialization/deserialization of the NIZK proof to a base64-based string encoding, in order to facilitate transmission over network protocols.
• [x] Add unit test coverage for this module.