I do not use the (slow) java class BigInteger to do the trial factoring.
Instead i look at the modulus due to a factor p of the factor base, which is an primitive int.
Only if the index x of the generating function a(x) + b mod p hits one of the two roots mod p for the factor p we do the expensive division.
But the division stage is still to slow.
