论文信息 - Faugere's F5 Algorithm Revisited - 字舞流文

Faugere's F5 Algorithm Revisited

Till Stegers | Till Stegers

[1] Rüdiger Gebauer,et al. On an Installation of Buchberger's Algorithm , 1988, J. Symb. Comput..

[2] Bruno Buchberger,et al. Gröbner Bases: A Short Introduction for Systems Theorists , 2001, EUROCAST.

[3] Magali Bardet,et al. Étude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie , 2004 .

[4] Martin Kreuzer,et al. Efficiently computing minimal sets of critical pairs , 2004, J. Symb. Comput..

[5] Antoine Joux,et al. Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases , 2003, CRYPTO.

[6] Jean Charles Faugère,et al. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.

[7] David A. Cox,et al. Ideals, Varieties, and Algorithms , 1997 .

[8] Hideki Imai,et al. Comparison Between XL and Gröbner Basis Algorithms , 2004, ASIACRYPT.

[9] Wolfgang Trinks,et al. Über B. Buchbergers verfahren, systeme algebraischer gleichungen zu lösen , 1978 .

[10] Carlo Traverso,et al. “One sugar cube, please” or selection strategies in the Buchberger algorithm , 1991, ISSAC '91.

[11] Carlo Traverso,et al. Gröbner bases computation using syzygies , 1992, ISSAC '92.

[12] Daniel Lazard,et al. Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations , 1983, EUROCAL.

[13] J. Faugère. A new efficient algorithm for computing Gröbner bases (F4) , 1999 .