How to use

modPow

function

in

BigInteger

function calculateDiffieHellmanSharedKey(cipherKey) {
  const publicKey = Rsa.decrypt(cipherKey);
  const publicClientKey = new BigInteger(publicKey, 10);
  return publicClientKey.modPow(Rsa.d, prime);
}