U.S. flag   An unofficial archive of your favorite United States government website

Computer Security Resource Center

Computer Security Resource Center

This is an archive
(replace .gov by .rip)
    Glossary
A  |  B  |  C  |  D  |  E  |  F  |  G  |  H  |  I  |  J  |  K  |  L  |  M  |  N  |  O  |  P  |  Q  |  R  |  S  |  T  |  U  |  V  |  W  |  X  |  Y  |  Z

x mod n

Abbreviation(s) and Synonym(s):

None

Definition(s):

  The unique remainder r, 0£ r £ (n – 1), when integer x is divided by positive integer n. For example, 23 mod 7 = 2.
Source(s):
NIST SP 800-106

  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.
Source(s):
NIST SP 800-56B Rev. 2
NIST SP 800-56B Rev. 1 [Superseded]