Given the equation $$ (x(b+x) + c - f) \mod (2x+2) = 0 $$ Is it possible and if so what is the quickest way to find appropriate value of $x$? Where $x > 0$
The above equation is derived from the following two quadratic equations $$ax^2+bx+c$$ $$dx^2+ex+f$$
example equations are $$x^2 + 27305078x + 20664318$$ $$x^2 + 27305076x + 186391793841444$$
resulting in $$(x(27305078+x) + 20664318 - 186391793841444) \mod (2x+2) = 0$$
All of the above is from an encryption/decryption scheme I am toying with so the example equations are trivial and the answer is found easily by iterative means but for non trivial equations iteration is too computationally expensive.