If $N-1$ could be factored easily with several small prime factors, then what is the fastest way to check $N$ for primality?
Updated
I'm aware of Pocklington primility test which is not good for small factors. I'm looking for a reduction in modular exponentitation when $N-1$ has several small factors.