feat: update paillier blum modulus to match cggmp24 version

[jfdreis]

No description provided.

[manel1874]

//! ZK-proof of Paillier-Blum modulus. Called Пmod or Rmod in the CGGMP24 paper.
//!
//! ## Description
//! A party P has a modulus `N = pq`, with p and q being Blum primes, and
//! `gcd(N, phi(N)) = 1`. P wants to prove that those equalities about N hold,
//! without disclosing p and q.

Add the relation that p, q = 3 mod 4:

//! ZK-proof of Paillier-Blum modulus. Called Пmod or Rmod in the CGGMP24 paper.
//!
//! ## Description
//! A party P has a Paillier-Blum modulus `N = pq`, with p and q being primes such
//! that `gcd(N, phi(N)) = 1` and `p,q = 3 \mod 4`. P wants to prove that those 
//! equalities about N hold, without disclosing p and q.

[manel1874]

What is a Blum prime? I believed here they wanted to say safe prime:

//! // 0. Prover P derives two Blum primes and makes a Paillier-Blum modulus
//! let p = fast_paillier::utils::generate_safe_prime(&mut rng, 256);
//! let q = fast_paillier::utils::generate_safe_prime(&mut rng, 256);
//! let n = (&p * &q).complete();