Abstract
Because of the previously mentioned NP-Complete status of MQ, the topic of how to actually solve these systems has the disadvantage that truly efficient (i.e. polynomial time) algorithms have not yet been found. In fact, they will never be found if P ≠ NP. Nonetheless, there are algorithms available for experimentation, many of which we describe below.
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). Algorithms for Solving Polynomial Systems. In: Algebraic Cryptanalysis. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-88757-9_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-88757-9_12
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)