Solving sparse MRHS systems with genetic algorithms

DOI10.2478/TMMP-2025-0029MaRDI QIDQ7227714zbMATH OpenFDO

Authors Eugen Antal, Pavol Zajac, Sabina Pekareková

Publication date 10 April 2026

Published in Tatra Mountains Mathematical Publications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/TMMP-2025-0029

zbMATH Keywords

algebraic cryptanalysisgenetic algorithmMRHS equation systemsMRHS problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Cryptography (94A60)

Cites work

• A comparison of local reduction and SAT-solver based algebraic cryptanalysis of JH and Keccak
• Algebraic cryptanalysis of \textsf{Present} based on the method of syllogisms
• Algebraic cryptanalysis of Ascon using MRHS equations
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• Local reduction and the algebraic cryptanalysis of the block cipher GOST
• MRHS solver based on linear algebra and exhaustive search
• On solving sparse MRHS equations with bit-flipping
• Solving multiple right hand sides linear equations
• Solving Trivium-based Boolean equations using the method of syllogisms

This page was built for publication: Solving sparse MRHS systems with genetic algorithms

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