Efficient probabilistic algorithm for solving quadratic equations over finite fields
T. Itoh · Electronics Letters · 1987
An efficient probabilistic algorithm for solving quadratic equations over GF(p) (p is odd prime) and GF(2m) is proposed. This algorithm solves the given quadratic equations probabilistically with probability 0-5 in each trial and is more efficient than Rabin's method for quadratic equations over GF(p) and GF(2m).