Analytic methods in the analysis and design of number-theoretic algorithms
Analytic methods in the analysis and design of number-theoretic algorithms
A one-parameter quadratic-base version of the Baillie-PSW probable prime test
Mathematics of Computation
| Hi-index | 0.00 |
For determining whether an input number is prime, there are two kinds of algorithms, a primality test and a primality proving. A primality test is very efficient but probabilistic, that is, there are certain errors in determining primality. On the other hand, a primality proving always gives a correct answer but it is not so efficient. Grantham proposed a very interesting problem on the Quadratic Frobenius Test (QFT) which is a primality test. If we negatively solve the problem, then we can construct a primality proving more efficient than any other existing primality proving. To solve Grantham's problem, it is important to study when QFT fails. In this paper, as the first step to solve Grantham's problem, we show two conditions on a given odd composite number n and parameters a,b of QFT such that n passes QFT for a,b. Based on these conditions, we made a computational experiment that may suggest the problem will be negatively solved. Moreover, the two conditions give two algorithms computing a pair (a,b) for which a given odd composite number n passes QFT, where n's prime factorization is known.