MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy

DOI10.1007/978-3-540-88403-3_14MaRDI QIDQ3535362zbMATH OpenOpenAlexFDO

Authors Mohamed Saied Emam Mohamed, Wael Said Elmageed Mohamed Abd, Jintai Ding, Johannes Buchmann

Publication date 11 November 2008

Published in Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88403-3_14

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• On the relation between the MXL family of algorithms and Gröbner basis algorithms
• scientific article; zbMATH DE number 1962148
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• MXL₃: an efficient algorithm for computing Gröbner bases of zero-dimensional ideals
• Mutant Zhuang-Zi algorithm

Cites work

• A public key system with signature and master key functions
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• scientific article; zbMATH DE number 4070803 (Why is no real title available?)
• Public Key Cryptography – PKC 2004

Cited in

(13)

• Cryptanalysis of the lifted unbalanced oil vinegar signature scheme
• Cryptanalysis of \textsf{LRainbow}: the lifted rainbow signature scheme
• Computing border bases using mutant strategies
• A Variant of the F4 Algorithm
• Mutant Zhuang-Zi algorithm
• MXL₃: an efficient algorithm for computing Gröbner bases of zero-dimensional ideals
• On the relation between the MXL family of algorithms and Gröbner basis algorithms
• Worst-case subexponential attacks on PRGs of constant degree or constant locality
• On the complexity of solving generic overdetermined bilinear systems
• A new central map for multivariate encryption scheme
• Polynomial XL: a variant of the XL algorithm using Macaulay matrices over polynomial rings
• An upper bound for the solving degree in terms of the degree of regularity
• Constrained verifiable random functions without obfuscation and friends

Describes a project that uses

Uses Software

• M4RI

This page was built for publication: MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy

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