Revision as of 15:18, 6 November 2009 edit Derbenhadron~enwiki (talk \| contribs) 2 edits →References ← Previous edit		Revision as of 14:44, 24 February 2010 edit undo Zadneram (talk \| contribs) 10 edits m Added link to HFE Next edit →
Line 11: This strategy allows the algorithm to apply two new criteria based on what Faugère calls ''signatures'' of polynomials. Thanks to these criteria, the algorithm can compute Gröbner bases for a large class of interesting polynomial systems, called ''regular sequences'', without ever simplifying a single polynomial to zero--the most time-consuming operation in algorithms that compute Gröbner bases. The previously intractable "cyclic 10" problem was solved by F5, as were a number of systems related to cryptography; for example [[Hidden Field Equations\|HFE]] and C<sup>*</sup>. ==References==

Faugère's F4 and F5 algorithms: Difference between revisions