A combinatorial problem related to sparse systems of equations
Authors:
- Peter HorakPHPeter Horak
- Igor SemaevISIgor Semaev
- 2 November 2016
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 85 (1) , 129-144
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- MaxMinMax problem and sparse equations over finite fieldsDesigns, Codes and Cryptography, 2015
- Speeding up deciphering by hypergraph orderingDesigns, Codes and Cryptography, 2013
- A new method to solve MRHS equation systems and its connection to group factorizationJournal of Mathematical Cryptology, 2013
- Improved Agreeing-Gluing AlgorithmMathematics in Computer Science, 2013
- Solving Multiple Right Hand Sides linear equationsDesigns, Codes and Cryptography, 2008
- On solving sparse algebraic equations over finite fieldsDesigns, Codes and Cryptography, 2008
- MRHS Equation Systems2007
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations2002