Flexible partial enlargement to accelerate Gröbner basis computation over F₂

DOI10.1007/978-3-642-12678-9_5MaRDI QIDQ3558304zbMATH OpenOpenAlexFDO

Authors Daniel Cabarcas, Mohamed Saied Emam Mohamed, Johannes Buchmann, Jintai Ding

Publication date 4 May 2010

Published in Progress in cryptology -- AFRICACRYPT 2010. Third international conference on cryptology in Africa, Stellenbosch, South Africa, May 3--6, 2010. Proceedings (Search for Journal in Brave)

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

zbMATH Keywords

algebraic cryptanalysiscomplexityGröbner basisHFE

Mathematics Subject Classification ID

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

Recommendations

• Algebraic attacks from a Groebner basis perspective
• M4GB. An efficient Gröbner-basis algorithm
• A Variant of the F4 Algorithm
• Advances in Cryptology - CRYPTO 2003
• The implementation and complexity analysis of the branch Gröbner bases algorithm over Boolean polynomial rings

Cited in

(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\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558304)