We are using your library for implementing homomorphic encryption schemes. During benchmarking I realised that the 'modInverse' implementation of BigInteger is an order of magnitude slower than the GMP one.
Therefore I extended your code to also offer access to the GMP implementation for computing a modular inverse.
I believe this modifications could be useful to others trying to improve the runtime of their Java crypto implementations.
We are using your library for implementing homomorphic encryption schemes. During benchmarking I realised that the 'modInverse' implementation of BigInteger is an order of magnitude slower than the GMP one. Therefore I extended your code to also offer access to the GMP implementation for computing a modular inverse. I believe this modifications could be useful to others trying to improve the runtime of their Java crypto implementations.