Two infinite sets of primes with fast primality tests

Infinite sets P and Q of primes are described, P ⊂ Q. For any natural number n it can be decided if n ∈ P in (deterministic) time Ο((log n)⁹). This answers affirmatively the question of whether there exists an infinite set of primes whose membership can be tested in polynomial time, and is the main result of the paper. Also, for every n ∈ Q, we show how to produce at random, in expected time Ο((log n)³), a certificate of length Ο(log n) which can be verified in (deterministic) time Ο((log n)³); this is less than the time needed for two exponentiations and is much faster than existing methods. Finally it is important that P is relatively dense (at least cn^2/3/log n elements less than n). Elements of Q in a given range may be generated quickly, but it would be costly for an adversary to search Q in this range; this could be useful in cryptography.