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

GF(q)

Note: parentTerm.TermNote

Abbreviation(s) and Synonym(s):

None

Definition(s):

  The finite field with q elements, where either q is an odd prime p or q is equal to 2m, for some prime integer m. The elements of GF(q) are represented by the set of integers {0, 1, …, p-1} in the case that q is an odd prime p, or as bit strings of length m bits in the case that q = 2m.
Source(s):
NIST SP 800-56A Rev. 2