GF(q)

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

Note: parentTerm.TermNote

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 [Superseded]

Glossary Comments

Comments about specific definitions should be sent to the authors of the linked Source publication. For NIST publications, an email is usually found within the document.

Comments about the glossary's presentation and functionality should be sent to secglossary@nist.gov.

See NISTIR 7298 Rev. 3 for additional details.

Information Technology Laboratory

Computer Security Resource Center

Computer Security Resource Center

GF(q)

Glossary Comments