Math 2.0

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 ๐”ฝpn\F_{p^n} is the set of polynomials of degree less than nn over ๐”ฝp\F_p. One computes with them modulo a fixed irreducible polynomial of degree nn. It is the basis of error-correcting codes and of much of modern cryptography.

Further reading

  1. Web https://en.wikipedia.org/wiki/Finite_field_arithmetic
About this page
TagYG3HWE6GEX
URIm2://YG3HWE6GEX
Kindconcept
WritingW0 stub
MSC12E20, 11T71, 12-08
Same as
Changed2 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

Definitions