@MISC{Grantham_aprobable, author = {Jon Grantham}, title = {A Probable Prime Test With High Confidence}, year = {} }

Share

OpenURL

Abstract

. Monier and Rabin proved that an odd composite can pass the Strong Probable Prime Test for at most 1 4 of the possible bases. In this paper, a probable prime test is developed using quadratic polynomials and the Frobenius automorphism. The test, along with a fixed number of trial divisions, ensures that a composite n will pass for less than 1 7710 of the polynomials x 2 \Gamma bx \Gamma c with i b 2 +4c n j = \Gamma1 and \Gamma \Gammac n \Delta = 1. The running time of the test is asymptotically 3 times that of the Strong Probable Prime Test. x1 Background Perhaps the most common method for determining whether or not a number is prime is the Strong Probable Prime Test. Given an odd integer n, let n = 2 r s + 1 with s odd. Choose a random integer a with 1 a n \Gamma 1. If a s j 1 mod n or a 2 j s j \Gamma1 mod n for some 0 j r \Gamma 1, then n passes the test. An odd prime will pass the test for all a. The test is very fast; it requires no more than (1 +...