Abstract
Algebraic cryptanalysis usually requires to find solutions of several similar polynomial systems. A standard tool to solve this problem consists of computing the Gröbner bases of the corresponding ideals, and Faugère's F4 and F5 are two well-known algorithms for this task. In this paper, we adapt the "Gröbner trace" method of Traverso to the context of F4. The resulting variant is a heuristic algorithm, well suited to algebraic attacks of cryptosystems since it is designed to compute with high probability Gröbner bases of a set of polynomial systems having the same shape. It is faster than F4 as it avoids all reductions to zero, but preserves its simplicity and its efficiency, thus competing with F5. © 2011 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Joux, A., & Vitse, V. (2011). A variant of the F4 algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6558 LNCS, pp. 356–375). Springer Verlag. https://doi.org/10.1007/978-3-642-19074-2_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
