mod Pow
Performs a modPow operation on the base big integer, using exp and mod for encryption/decryption.
Return
a big integer that is the result of base^exponent % mod
Parameters
the base input data to be encrypted or decrypted
the exponent to use for encryption/decryption
the modulo to use. Note that even modulo are not supported with native JNA-GMP, if an even modulo is provided, native support is disabled and code falls back to traditional variant.
whether to prefer native JNA-GMP library for the modPow operation or use the normal big integer variant from java. The native variant is about ~4.7 times faster than the java variant. Native is only supported for Mac and 64-bit Linux. For windows and other variants, the traditional java variant is used.
Throws
mod ≤ 0 or the exponent is negative and base is not relatively prime to mod.