How to make a FAST overflow resistant mod pow (modular exponentiation) in c#?

Question

I am trying to make a super fast prime check for an extension methods library I\'m working on. Right now I am trying to make a modpow that is fast. I am NOT willing to use BigIn