Boolean ring cryptographic equation solving

DOI10.1007/978-3-030-81652-0_10MaRDI QIDQ832346zbMATH OpenOpenAlexFDO

Authors Sean Murphy, Christine Swart, Maura Paterson

Publication date 25 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-81652-0_10

zbMATH Keywords

Boolean ring\texttt{LPN} problem\texttt{MQ} problem\texttt{XL} algorithmGröbner basis

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Chain conditions on other classes of submodules, ideals, subrings, etc.; coherence (associative rings and algebras) (16P70)

Recommendations

• A crossbred algorithm for solving Boolean polynomial systems
• On the complexity of solving quadratic Boolean systems
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
• Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)

Cites work

• scientific article; zbMATH DE number 1583768 (Why is no real title available?)
• scientific article; zbMATH DE number 4070803 (Why is no real title available?)
• scientific article; zbMATH DE number 1302851 (Why is no real title available?)
• scientific article; zbMATH DE number 1950612 (Why is no real title available?)
• scientific article; zbMATH DE number 1962148 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 1418284 (Why is no real title available?)
• scientific article; zbMATH DE number 6665535 (Why is no real title available?)
• A geometric view of cryptographic equation solving
• A polynomial-time key-recovery attack on MQQ cryptosystems
• Advances in Cryptology - CRYPTO 2003
• Algebraic Cryptanalysis of 58-Round SHA-1
• All in the XL Family: Theory and Practice
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Analysing and exploiting the Mantin biases in RC4
• Comparison Between XL and Gröbner Basis Algorithms
• Complexity of solving algebraic equations
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
• Cryptanalysis of MinRank
• Cryptanalysis of the Matsumoto and Imai public key scheme of EUROCRYPT '98
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Geometric ideas for cryptographic equation solving in even characteristic
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• Multivariate Public Key Cryptography
• Noise-tolerant learning, the parity problem, and the statistical query model
• Overview of Cryptanalysis Techniques in Multivariate Public Key Cryptography
• Practical Key-Recovery for All Possible Parameters of SFLASH
• The XL-Algorithm and a Conjecture from Commutative Algebra

Cited in

(3)

• A crossbred algorithm for solving Boolean polynomial systems
• Unique solutions of Boolean ring equations
• Solving non-linear Boolean equation systems by variable elimination

Describes a project that uses

Uses Software

• MutantXL

This page was built for publication: Boolean ring cryptographic equation solving

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