x -1 mod n

{
  "id": "MLC-T-CYB-004660",
  "term": "x -1 mod n",
  "field": "Cybersecurity",
  "definition": "1. The multiplicative inverse of the integer x modulo the positive integer n. This quantity is defined if and only if x is relatively prime to n. For the purposes of this Recommendation, y = x-1 mod n is the unique integer satisfying the following two conditions:\n\n2. The multiplicative inverse of the integer x modulo the positive integer n. This quantity is defined if and only if x is relatively prime to n. For the purposes of this Recommendation, y = x-1 mod n is the unique integer satisfying the following two conditions: 1) 0 ≤ y < n, and 2) 1 = (xy) mod n.",
  "references": [
    "NIST SP 800-56B Rev. 2",
    "NIST SP 800-56B Rev. 1 [Superseded]",
    "NIST CSRC Glossary"
  ],
  "url": "https://mlchart.com/terminology/cybersecurity/x-1-mod-n/"
}