  In this work, we add an additional condition to strong pseudo prime test to
base 2. Then, we provide theoretical and heuristics evidences showing that the
resulting algorithm catches all composite numbers. Our method is based on the
structure of singular cubics' Jacobian groups on which we also define an
effective addition algorithm.
