Finite Field Arithmetic
Arithmetic in a finite field is different from standard integer arithmetic. There are a limited number of elements in the finite field; all operations performed in the finite field result in an element within that field.
While each finite field is itself not infinite, there are infinitely many different finite fields; their number of elements (which is also called cardinality) is necessarily of the form pn where p is a prime number and n is a positive integer, and two finite fields of the same size are isomorphic. The prime p is called the characteristic of the field, and the positive integer n is called the dimension of the field over its prime field.
Finite fields are used in a variety of applications, including in classical coding theory in linear block codes such as BCH codes and Reed–Solomon error correction and in cryptography algorithms such as the Rijndael encryption algorithm.
Read more about Finite Field Arithmetic: Effective Polynomial Representation, Addition and Subtraction, Multiplication, Arithmetic Example (where The Characteristic Is Not 2)
Famous quotes containing the words finite, field and/or arithmetic:
“Are not all finite beings better pleased with motions relative than absolute?”
—Henry David Thoreau (1817–1862)
“Because mothers and daughters can affirm and enjoy their commonalities more readily, they are more likely to see how they might advance their individual interests in tandem, without one having to be sacrificed for the other.”
—Mary Field Belenky (20th century)
“I hope I may claim in the present work to have made it probable that the laws of arithmetic are analytic judgments and consequently a priori. Arithmetic thus becomes simply a development of logic, and every proposition of arithmetic a law of logic, albeit a derivative one. To apply arithmetic in the physical sciences is to bring logic to bear on observed facts; calculation becomes deduction.”
—Gottlob Frege (1848–1925)