x mod n

{
  "id": "MLC-T-CYB-004661",
  "term": "x mod n",
  "field": "Cybersecurity",
  "definition": "1. The unique remainder r, 0≤ r ≤ (n - 1), when integer x is divided by positive integer n. For example, 23 mod 7 = 2.\n\n2. The modular reduction of the (arbitrary) integer x by the positive integer n (the modulus). For the purposes of this Recommendation, y = x mod n is the unique integer satisfying the following two conditions: 1) 0 ≤ y < n, and 2) x - y is divisible by n.",
  "references": [
    "NIST SP 800-106",
    "NIST SP 800-56B Rev. 2; NIST SP 800-56B Rev. 1 [Superseded]",
    "NIST CSRC Glossary"
  ],
  "url": "https://mlchart.com/terminology/cybersecurity/x-mod-n/"
}