This implementation is efficient for operations traditionally used in
cryptography, such as the generation of large prime numbers and computation
of the modular inverse.
Slow Two's Complement Bitwise Operations
This API includes operations for bitwise operations in two's complement
representation. Two's complement is not the internal representation used by
this implementation, so such methods may be inefficient. Use Java.Util.BitSet for high-performance bitwise operations on
arbitrarily-large sequences of bits.