Abstract
Before we devote numerous pages to the topic of polynomial systems of equations over finite fields, we should pause and ask why one would want to do this. This will give us an opportunity to highlight the several applications of this interesting area.
Before that, however, an important distinction must be made. In this book, when one has a system of equations over the finite field \(\mathbb{G}\mathbb{F}\)(pn), we assume that one is interested only in those solutions which are also elements of \(\mathbb{G}\mathbb{F}\)(pn). If one is also interested in solutions in some extension field, (e.g. \(\mathbb{G}\mathbb{F}\)(pm) with n|m), then since \(\mathbb{G}\mathbb{F}\)(pn) is a subfield of \(\mathbb{G}\mathbb{F}\)(pm), it is safe to consider the system of equations as if it were over \(\mathbb{G}\mathbb{F}\)(pn), or at worse the splitting field.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag US
About this chapter
Cite this chapter
Bard, G.V. (2009). Strategies for Polynomial Systems. In: Algebraic Cryptanalysis. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-88757-9_11
Download citation
DOI: https://doi.org/10.1007/978-0-387-88757-9_11
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-88756-2
Online ISBN: 978-0-387-88757-9
eBook Packages: Computer ScienceComputer Science (R0)