Comparison Between XL and Gröbner Basis Algorithms-Reference-Cited by-同舟云学术

Comparison Between XL and Gröbner Basis Algorithms

Published:2004 Issue: Volume: Page:338-353
ISSN:0302-9743
Container-title:Advances in Cryptology - ASIACRYPT 2004
language:
Short-container-title:

Author:

Ars Gwénolé,Faugère Jean-Charles,Imai Hideki,Kawazoe Mitsuru,Sugita Makoto

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30539-2_24.pdf

Reference22 articles.

1. Lecture Notes in Computer Science;F. Armknecht,2003

2. Ars, G., Faugère, J.-C.: Comparison of XL and Gröbner Basis Algorithms over Finite Fields. Technical report, INRIA Rocquencourt (2004)

3. Bardet, M., Faugère, J.-C., Salvy, B.: Complexity of Gröbner basis computation for semi-regular sequences over $\mathbb{F}_2$ with solutions in $\mathbb{F}_2$ . Technical report, INRIA Rocquencourt (2003)

4. Becker, T., Weispfenning, V.: Gröbner Basis: A Computational Approach to Commutative Algebra. Springer, New York (1993)

5. Lecture Notes in Computer Science;N. Courtois,2001

Cited by 54 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polynomial XL: A Variant of the XL Algorithm Using Macaulay Matrices over Polynomial Rings;Lecture Notes in Computer Science;2024

2. Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems;Quantum;2023-07-26

3. Worst-Case Subexponential Attacks on PRGs of Constant Degree or Constant Locality;Advances in Cryptology – EUROCRYPT 2023;2023

4. An improvement of algorithms to solve under-defined systems of multivariate quadratic equations;JSIAM Letters;2023

5. Recent progress in the security evaluation of multivariate public‐key cryptography;IET Information Security;2022-09-03