Cryptology ePrint Archive: Report 2010/158
A variant of the F4 algorithm
Antoine Joux and Vanessa Vitse
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 present a new variant of the F4 algorithm which is well suited to algebraic attacks of cryptosystems since it is designed to compute 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 computation efficiency, thus competing with F5.
Category / Keywords: Gröbner basis, F4, F5, multivariate cryptography, algebraic cryptanalysis
Date: received 24 Mar 2010
Contact author: vanessa vitse at prism uvsq fr
Available formats: PDF | BibTeX Citation
Version: 20100324:154206 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]