Field theory and polynomials Finite fields Concept
Finite field arithmetic
Summary
Finite field arithmetic is the way to add, multiply and divide elements of a finite field in practice. The usual model of is the set of polynomials of degree less than over . One computes with them modulo a fixed irreducible polynomial of degree . It is the basis of error-correcting codes and of much of modern cryptography.
Further reading
About this page
| Tag | YG3HWE6GEX |
|---|---|
| URI | m2://YG3HWE6GEX |
| Kind | concept |
| Writing | W0 stub |
| MSC | 12E20, 11T71, 12-08 |
| Same as | |
| 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.