Facebook Instagram Twitter RSS Feed Back to top

Connecting the complexity of MQ- and code-based cryptosystems

In: Tatra Mountains Mathematical Publications, vol. 70, no. 3
Pavol Zajac

Details:

Year, pages: 2017, 163 - 177
Keywords:
decoding problem, MQ problem, MRHS
About article:
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.
How to cite:
ISO 690:
Zajac, P. 2017. Connecting the complexity of MQ- and code-based cryptosystems. In Tatra Mountains Mathematical Publications, vol. 70, no.3, pp. 163-177. 1210-3195.

APA:
Zajac, P. (2017). Connecting the complexity of MQ- and code-based cryptosystems. Tatra Mountains Mathematical Publications, 70(3), 163-177. 1210-3195.