MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals
From MaRDI portal
Publication:3578263
DOI10.1007/978-3-642-14423-3_7zbMath1305.94066OpenAlexW2062777165MaRDI QIDQ3578263
Mohamed Saied Emam Mohamed, Stanislav Bulygin, Daniel Cabarcas, Johannes A. Buchmann, Jintai Ding
Publication date: 16 July 2010
Published in: Information, Security and Cryptology – ICISC 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14423-3_7
Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (7)
Evaluation of Solving Time for Multivariate Quadratic Equation System Using XL Algorithm Over Small Finite Fields on GPU ⋮ Inverting square systems algebraically is exponential ⋮ Computing border bases using mutant strategies ⋮ Mutant Differential Fault Analysis of Trivium MDFA ⋮ On the relation between the MXL family of algorithms and Gröbner basis algorithms ⋮ Cryptanalysis of \textsf{LRainbow}: the lifted rainbow signature scheme ⋮ Cryptanalysis of the lifted unbalanced oil vinegar signature scheme
This page was built for publication: MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals
