Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over $\mathbb{F}_2$

DOI10.1007/978-3-642-12678-9_5zbMath1284.94058OpenAlexW1480291365MaRDI QIDQ3558304

Mohamed Saied Emam Mohamed, Daniel Cabarcas, Jintai Ding, Johannes A. Buchmann

Publication date: 4 May 2010

Published in: Progress in Cryptology – AFRICACRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12678-9_5

zbMATH Keywords

complexityGröbner basisalgebraic cryptanalysisHFE

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (3)

Computing border bases using mutant strategies ⋮ On the relation between the MXL family of algorithms and Gröbner basis algorithms ⋮ On the complexity of solving generic overdetermined bilinear systems

This page was built for publication: Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over $\mathbb{F}_2$