Binary Finite Field Arithmetic

Part of the Signals and Communication Technology book series (SCT)


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.


Fermat Verse 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2006

Personalised recommendations