Strong pseudoprimes to base 2

Abstract

In this work, we add an additional condition to strong pseudoprime test to base 2. Then, we provide theoretical and heuristic evidence showing that the resulting algorithm catches all composite numbers. Therefore, we believe that our method provides a probabilistic primality test with a running time O(log(2+epsilon) n) for an integer n and epsilon > 0. Our method is based on the structure of singular cubics' Jacobian groups on which we also define an effective addition algorithm.