Use "fast" modular power function for computing x^(p^i) in is_irreducible_rabin.
This should be using the Kaltofen method described in von zur Gathen/Shoup. So
this is not the best way to do it, just slightly faster than the old method.