Cryptography (Miller rabin) library issue

I have a problem with this code to generate large prime number using miller rabin for example (t) and (t-1) is multiplication of 2^n where n=8192. the code do such a thing but the libraries is is what i can not find. thanks in advance.