Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Algorithm for Solving Massively Underdefined Systems of Multivariate Quadratic Equations over Finite Fields (1507.03674v1)

Published 14 Jul 2015 in cs.CR and cs.SC

Abstract: Solving systems of m multivariate quadratic equations in n variables (MQ-problem) over finite fields is NP-hard. The security of many cryptographic systems is based on this problem. Up to now, the best algorithm for solving the underdefined MQ-problem is Hiroyuki Miura et al.'s algorithm, which is a polynomial-time algorithm when [n \ge m(m + 3)/2] and the characteristic of the field is even. In order to get a wider applicable range, we reduce the underdefined MQ-problem to the problem of finding square roots over finite field, and then combine with the guess and determine method. In this way, the applicable range is extended to [n \ge m(m + 1)/2], which is the widest range until now. Theory analysis indicates that the complexity of our algorithm is [O(q{n\omega }m{(\log {\kern 1pt} {\kern 1pt} q)2}){\kern 1pt} ] when characteristic of the field is even and [O(q{2m}{n\omega }m{(\log {\kern 1pt} {\kern 1pt} q)2})] when characteristic of the field is odd, where [2 \le \omega \le 3] is the complexity of Gaussian elimination.

Citations (1)

Summary

We haven't generated a summary for this paper yet.