@article {26351,
	title = {MRHS solver based on linear algebra and exhaustive search},
	journal = {Journal of Mathematical Cryptology},
	volume = {12},
	year = {2018},
	month = {09/2018},
	pages = {143-157},
	publisher = {De Gruyter},
	abstract = {We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher{\textquoteright}s resistance against algebraic attacks. We give an algorithm for solving the system and compute its complexity. The complexity is normally close to exhaustive search on the variables representing the user-selected key. Finally, we show that for some variants of LowMC, the joined MRHS matrix representation can be used to speed up regular encryption in addition to exhaustive key search.},
	keywords = {algebraic cryptanalysis, LowMC, MRHS},
	issn = {1862-2976},
	doi = {https://doi.org/10.1515/jmc-2017-0005},
	url = {https://www.degruyter.com/view/j/jmc.2018.12.issue-3/jmc-2017-0005/jmc-2017-0005.xml?format=INT},
	author = {Raddum, H{\r a}vard and Zajac, Pavol}
}
