Primality testing and Jacobi sums
Henri Cohen, Hendrik W. Lenstra · Mathematics of Computation · 1984
We present a theoretically and algorithmically simplified version of a primality testing algorithm that was recently invented by Adleman and Rumely. The new algorithm performs well in practice. It is the first primality test in existence that can routinely handle numbers of hundreds of decimal digits.