On solving sparse MRHS equations with bit-flipping

DOI10.5486/PMD.2022.SUPPL.8MaRDI QIDQ5886165zbMATH OpenFDO

Authors Pavol Zajac

Publication date 30 March 2023

Published in Publicationes Mathematicae Debrecen (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5486/PMD.2022.SUPPL.8

zbMATH Keywords

algebraic cryptanalysisbit-flippingMRHS

Mathematics Subject Classification ID

Computational methods for problems pertaining to general algebraic systems (08-08) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• MRHS Equation Systems that can be Solved in Polynomial Time
• Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
• A new method to solve MRHS equation systems and its connection to group factorization
• On solving sparse algebraic equations over finite fields
• Sparse Boolean equations and circuit lattices

Cited in

(3)

• Polynomial reduction from syndrome decoding problem to regular decoding problem
• Algebraic cryptanalysis of Ascon using MRHS equations
• Solving sparse MRHS systems with genetic algorithms

This page was built for publication: On solving sparse MRHS equations with bit-flipping

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