Function inverseMod

Ciphers/AffineCipher.js:26–30

* Modular multiplicative inverse * @param {Number} a - A coefficient * @param {Number} m - Modulos value * @return {Number} Return modular multiplicative inverse of coefficient a and modulos m

(a, m)

 * @return {Number} Return modular multiplicative inverse of coefficient a and modulos m
 */
function inverseMod(a, m) {
  for (let x = 1; x < m; x++) {
    if (mod(a * x, m) === 1) return x
  }
}

/**
 * Argument validation