private BigInteger Test(BigInteger h0, BigInteger h1, BigInteger p2, BigInteger x, BigInteger y, List <BigInteger> m, List <BigInteger> v, BigInteger N)
{
BigInteger m2 = 0, n = 0, pr = 0;
BigInteger t, tModN = 0;
EllipticCurve_Point P = new EllipticCurve_Point();
P.X = x;
P.Y = y;
t = Maths.ChineseRemainderTheorem(m, v);
tModN = (t % N) % q2;
n = TestHelper(h0, h1, p2, tModN, P);
if (n != -1)
{
return(n);
}
return(-1);
}
