Field theory and polynomials Definition
Finite field arithmetic
Builds on Finite fieldIrreducible polynomialPolynomial ringQuotient ringDegree of a polynomialPolynomial long divisionEuclidean algorithm
Definition
Let be a prime, let , and let be a monic irreducible polynomial of degree . The quotient ring of the polynomial ring is a finite field with elements. Finite field arithmetic in this representation computes with the polynomials of degree less than over , one for each element, as follows.
- The sum is the coefficientwise sum modulo .
- The product is the remainder of the polynomial product under division by .
- The inverse of is the polynomial of degree less than with for some , found by the extended Euclidean algorithm.
Remarks
Take and , which has no root in and so is irreducible. Then , and its remainder modulo is . The inverse of is , since . The polynomial over cannot serve as , since , and then has no inverse. Over , an element is stored as the bit string of its coefficients, and addition is the bitwise exclusive or. The inverse can also be computed as , since for .
Reading path
To understand this page from the ground up, read these 18 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Euclidean algorithm concept
- Group concept
- Polynomial long division concept
- Ring definition
- Commutative ring definition
- Polynomial ring definition
- Unit of a ring definition
- Zero divisor definition
- Ideal definition
- Degree of a polynomial definition
- Field definition
- Integral domain definition
- Two-sided ideal definition
- Finite field definition
- Quotient ring definition
- Irreducible element definition
- Irreducible polynomial definition
- Finite field arithmetic definition
Further reading
About this page
| Tag | 92JCZQZSST |
|---|---|
| URI | m2://92JCZQZSST |
| Kind | definition |
| Writing | W0 stub |
| MSC | 12E20, 11T71, 12-08 |
| Defines | Finite field arithmetic |
| Uses | Finite field, Irreducible polynomial, Polynomial ring, Quotient ring, Degree of a polynomial, Polynomial long division, Euclidean algorithm |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.