An idea to reduce every polynomial to either linear or quadratic congruence is proposed by (Eugen, 2006).
Root-finding iterative technique is employed to find solutions of linear and quadratic congruences modulo with higher power of a prime p .
[B.sub.MA] is indeed the residual in a quadratic congruence
of the union of a subgrassmannian G(1, L) (where L is a [P.sup.3]) with a congruence of multidegree (1, 3, 0) contained in a very special linear congruence.
He covers integers, polynomials, lines, and congruences; quadratic congruences
and quadratic equations; and cubic equations and elliptic curves.