import org.bouncycastle.pqc.math.ntru.polynomial.Resultant; //导入依赖的package包/类
private void verifyResultant(IntegerPolynomial a, Resultant r)
{
    BigIntPolynomial b = new BigIntPolynomial(a).mult(r.rho);
    BigInteger[]     bCoeffs = b.getCoeffs();

    for (int j = 1; j < bCoeffs.length - 1; j++)
    {
        assertEquals(BigInteger.ZERO, bCoeffs[j]);
    }
    if (r.res.equals(BigInteger.ZERO))
    {
        assertEquals(BigInteger.ZERO, bCoeffs[0].subtract(bCoeffs[bCoeffs.length - 1]));
    }
    else
    {
        assertEquals(BigInteger.ZERO, (bCoeffs[0].subtract(bCoeffs[bCoeffs.length - 1]).mod(r.res)));
    }
    assertEquals(bCoeffs[0].subtract(r.res), bCoeffs[bCoeffs.length - 1].negate());
}