Binary Finite Field Arithmetic
In this Chapter we review some of the most relevant arithmetic algorithm on binary extension fields GF(2m). The arithmetic over GF(2m) has many important applications in the domains of theory of code theory and in cryptography [221, 227, 380]. Finite field’s arithmetic operations include: addition, subtraction, multiplication, squaring, square root, multiplicative inverse, division and exponentiation.
KeywordsField Multiplication Polynomial Multiplication Irreducible Polynomial Modular Reduction Field Element
Unable to display preview. Download preview PDF.