BigInteger w = null; // lambda(N)^-1 mod N
int bitLength = 0; // bit length of the modulus N
public Paillier(BigInteger pInput, BigInteger qInput, int bitLengthInput) throws PIRException
{
bitLength = bitLengthInput;
<BUG>int primeCertainty = Integer.parseInt(SystemConfiguration.getProperty("pir.primeCertainty", "128"));
</BUG>
BigInteger three = BigInteger.valueOf(3);
if ((pInput.compareTo(three) < 0) || (qInput.compareTo(three) < 0) || pInput.equals(qInput) || !pInput.isProbablePrime(primeCertainty)
|| !qInput.isProbablePrime(primeCertainty))

BigInteger w = null; // lambda(N)^-1 mod N
int bitLength = 0; // bit length of the modulus N
public Paillier(BigInteger pInput, BigInteger qInput, int bitLengthInput) throws PIRException
{
bitLength = bitLengthInput;
int primeCertainty = SystemConfiguration.getIntProperty("pir.primeCertainty", 128);
BigInteger three = BigInteger.valueOf(3);
if ((pInput.compareTo(three) < 0) || (qInput.compareTo(three) < 0) || pInput.equals(qInput) || !pInput.isProbablePrime(primeCertainty)
|| !qInput.isProbablePrime(primeCertainty))
