Answers are grounded in this paper and cite their sources.
The goal of the present paper is a survey of methods to solve equation systems common in cryptanalysis. The methods depend on the equation representation and fall into three categories: Gröbner basis algorithms, SAT-solving methods and Agreeing-Gluing algorithms.
No takes yet. Share an insight, caveat, or question.
Semaev et al. (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: