On a Modification of the Agrawal-Biswas Primality Test

Abstract

We present a variant of the Agrawal-Biswas algorithm, a Monte Carlo algorithm which tests the primality of an integer $N$ by checking whether or not $(x+a{)}^N$ and $x^N+a$ are equivalent in a residue ring of $\mathbb{Z}/N\mathbb{Z}[x]$. The variant that we present is also a randomization of Lenstra jr. and Pomerance's improvement to the Agrawal-Kayal-Saxena deterministic primality test. We show that our variant of the Agrawal-Biswas algorithm can be used with the Miller-Rabin primality test to yield an algorithm which is slower than the Miller-Rabin test but relatively more accurate.