A new method to solve MRHS equation systems and its connection to group factorization

DOI10.1515/JMC-2013-5012zbMATH Open1290.94141OpenAlexW1986062766MaRDI QIDQ2873166FDOQ2873166

Pavol Zajac

Publication date: 23 January 2014

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2013-5012

zbMATH Keywords

algebraic cryptanalysisCVPgroup factorizationMultiple right-hand side (MRHS) equations over finite fields

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cited In (5)

• Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
• MRHS Equation Systems that can be Solved in Polynomial Time
• MRHS solver based on linear algebra and exhaustive search
• A combinatorial problem related to sparse systems of equations
• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity

This page was built for publication: A new method to solve MRHS equation systems and its connection to group factorization

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