MRHS solver based on linear algebra and exhaustive search

DOI10.1515/JMC-2017-0005MaRDI QIDQ1787192zbMATH OpenOpenAlexWikidataFDO

Authors Håvard Raddum, Pavol Zajac

Publication date 4 October 2018

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

Full work available at URL https://doi.org/10.1515/jmc-2017-0005

zbMATH Keywords

algebraic cryptanalysisLowMCMRHS

Mathematics Subject Classification ID

Diophantine equations in many variables (11D72) Analysis of algorithms (68W40) Cryptography (94A60)

Recommendations

• A new method to solve MRHS equation systems and its connection to group factorization
• MRHS Equation Systems
• Solving multiple right hand sides linear equations
• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
• Algebraic Attacks Using IP-Solvers

Cites work

• A new method to solve MRHS equation systems and its connection to group factorization
• Ciphers for MPC and FHE
• scientific article; zbMATH DE number 1682693 (Why is no real title available?)
• PRESENT: An Ultra-Lightweight Block Cipher
• Solving multiple right hand sides linear equations

Cited in

(4)

• A new method to solve MRHS equation systems and its connection to group factorization
• Polynomial reduction from syndrome decoding problem to regular decoding problem
• Algebraic cryptanalysis of Ascon using MRHS equations
• Solving sparse MRHS systems with genetic algorithms

Describes a project that uses

Uses Software

• PRESENT
• LowMC
• SageMath

This page was built for publication: MRHS solver based on linear algebra and exhaustive search

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