An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate

We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equivalent to about two or three Miller-Rabin tests, but has a much smaller error probability, namely 256/331776t for t iterations of the test in the worst case. We also give bounds on the average-case behaviour of the test: consider the algorithm that repeatedly chooses random odd k bit numbers, subjects them to t iterations of our test and outputs the first one found that passes all tests. We obtain numeric upper bounds for the error probability of this algorithm as well as a general closed expression bounding the error. For instance, it is at most 2-155 for k = 500, t = 2. Compared with earlier similar results for the Miller-Rabin test, the results indicate that our test in the average case has the effect of nine Miller-Rabin tests. We also give bounds for the error in case a prime is sought by incremental search from a random starting point.

[1]  Jon Grantham,et al.  A Probable Prime Test with High Confidence , 1998, 1903.06823.

[2]  Zhenxiang Zhang,et al.  A one-parameter quadratic-base version of the Baillie-PSW probable prime test , 2002, Math. Comput..

[3]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[4]  Ivan Damgård,et al.  Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers , 2003, J. Symb. Comput..

[5]  Ivan Damgård,et al.  Speeding up Prime Number Generation , 1991, ASIACRYPT.

[6]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[7]  Siguna Müller,et al.  A Probable Prime Test with Very High Confidence for n equiv 1 mod 4 , 2001, ASIACRYPT.

[8]  Jeffrey Shallit,et al.  A binary algorithm for the Jacobi symbol , 1993, SIGS.

[9]  Pedro Berrizbeitia,et al.  Generalized Strong Pseudoprime Tests and Applications , 2000, J. Symb. Comput..

[10]  Michael Rosen,et al.  A classical introduction to modern number theory , 1982, Graduate texts in mathematics.

[11]  Jeffrey Shallit,et al.  Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.

[12]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 2 , 1981 .

[13]  C. Pomerance,et al.  The probability that a random probable prime is composite , 1989 .

[14]  Ronald Joseph Burthe.  Further investigations with the strong probable prime test , 1996, Math. Comput..

[15]  Manindra Agrawal,et al.  PRIMES is in P , 2004 .

[16]  Ivan Damgård,et al.  An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates , 2003, FCT.

[17]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[18]  Ivan Damgård,et al.  On Generation of Probable Primes By Incremental Search , 1992, CRYPTO.

[19]  I. Damgård,et al.  Average case error estimates for the strong probable prime test , 1993 .

[20]  Hyunsoo Yoon,et al.  New Modular Multiplication Algorithms for Fast Modular Exponentiation , 1996, EUROCRYPT.

[21]  Donald Ervin Knuth,et al.  The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information , 1978 .

[22]  Siguna Müller,et al.  On the Computation of Square Roots in Finite Fields , 2004, Des. Codes Cryptogr..

[23]  Andrew Granville,et al.  It is easy to determine whether a given integer is prime , 2004 .

[24]  Carl Pomerance,et al.  The pseudoprimes to 25⋅10⁹ , 1980 .

[25]  Ivan Damgård,et al.  Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers , 2005, J. Symb. Comput..