Boolean ring cryptographic equation solving

DOI10.1007/978-3-030-81652-0_10zbMATH Open1485.94110OpenAlexW3184415224MaRDI QIDQ832346FDOQ832346

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

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

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]Boolean ring\texttt{LPN} problem\texttt{MQ} problem\texttt{XL} algorithm

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)

Cites Work

• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Title not available (Why is that?)
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Multivariate Public Key Cryptography
• Overview of Cryptanalysis Techniques in Multivariate Public Key Cryptography
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Noise-tolerant learning, the parity problem, and the statistical query model
• Cryptanalysis of the Matsumoto and Imai public key scheme of EUROCRYPT '98
• Title not available (Why is that?)
• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• Title not available (Why is that?)
• Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
• Cryptanalysis of MinRank
• Title not available (Why is that?)
• Practical Key-Recovery for All Possible Parameters of SFLASH
• Title not available (Why is that?)
• The XL-Algorithm and a Conjecture from Commutative Algebra
• Comparison Between XL and Gröbner Basis Algorithms
• Title not available (Why is that?)
• A geometric view of cryptographic equation solving
• Complexity of solving algebraic equations
• All in the XL Family: Theory and Practice
• Analysing and exploiting the Mantin biases in RC4
• A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems
• Algebraic Cryptanalysis of 58-Round SHA-1
• Geometric ideas for cryptographic equation solving in even characteristic

Cited In (1)

• Unique solutions of Boolean ring equations

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)