Checking the Condition C_p
The central congruence condition of the Jacobi sum test, what it asserts, and how it is verified in practice.
Every page in the KEVOS library tagged Frobenius. 7 pages.
The central congruence condition of the Jacobi sum test, what it asserts, and how it is verified in practice.
Separating irreducible factors by degree using GCDs against Frobenius powers, and the early-abort strategies that make it fast.
Multiplication with reduction, inversion by extended Euclid or by exponentiation, and the Itoh-Tsujii method for extension fields.
Computing the p-radical of an order as a kernel, and the ring of multipliers that enlarges the order.
Finding roots of a polynomial in a finite field by GCD with the Frobenius polynomial followed by probabilistic splitting.
Schoof's polynomial-time algorithm for counting points on a curve over a finite field, and the SEA improvements.
Berlekamp's linear algebra approach to factoring over a finite field, the Berlekamp subalgebra, and when it outperforms the GCD pipeline.