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

DOI10.1007/978-3-540-88403-3_14zbMath1177.11094OpenAlexW1512302998MaRDI QIDQ3535362

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

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

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

Related Items (7)

Computing border bases using mutant strategies ⋮ 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 ⋮ Cryptanalysis of \textsf{LRainbow}: the lifted rainbow signature scheme ⋮ A Variant of the F4 Algorithm ⋮ Cryptanalysis of the lifted unbalanced oil vinegar signature scheme

Uses Software

• M4RI

Cites Work

• Unnamed Item
• Unnamed Item
• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• A public key system with signature and master key functions
• Public Key Cryptography – PKC 2004

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