A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Connecting the Complexity of MQ- and Code-Based Cryptosystems
2017
Tatra Mountains Mathematical Publications
Preserved Fulltext
We study the connection between the MQ problem and the decoding problem, through the intermediate MRHS representation. The main goal of this study is to explicitly bound the complexity of solving MQ systems with decoding tools. The main observation is that although the MQ problem over GF(2) can be efficiently transformed to syndrome decoding, the existing general decoding methods are not suitable to solve the system as efficiently as expected from the MQ representation.
doi:10.1515/tmmp-2017-0025
fatcat:yzztg4oxh5dpfcn3irvgxjojpi