FindSquareRoot uses Cipolla algorithm to solve x^2 = a (mod P) More information: https://en.wikipedia.org/wiki/Cipolla%27s_algorithm.

Jacobi method calculates Jacobi symbol.

TestPrime implements the Solovay–Strassen test for prime numbers More info: https://en.wikipedia.org/wiki/Solovay%E2%80%93Strassen_primality_test.

F2 represents field extension for F(sqrt(i)): {x + y*sqrt(i) | x, y from F_modulo}.