Abstract
We introduce binary polynomials and their arithmetic. Tests for irreducibility, primitivity, and a method for factorization are given. Many of the algorithms shown can easily be implemented in hardware. An important application is the linear feedback shift registers, described in chapter 41. The arithmetic operations with binary polynomials are the underlying methods for computations in binary finite fields which are treated in chapter 42.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Arndt, J. (2011). Binary polynomials. In: Matters Computational. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14764-7_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-14764-7_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14763-0
Online ISBN: 978-3-642-14764-7
eBook Packages: Computer ScienceComputer Science (R0)