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

DOI10.1515/jmc-2013-5012zbMath1290.94141OpenAlexW1986062766MaRDI QIDQ2873166

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

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

Related Items (5)

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

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