A generalization of Miller’s primality theorem

For any integer r we show that the notion of ω-prime to base a introduced by Berrizbeitia and Berry, 2000, leads to a primality test for numbers n congruent to 1 modulo r, which runs in polynomial time assuming the Extended Riemann Hypothesis (ERH). For r = 2 we obtain Miller's classical result.