In this paper, we propose a multivariate quadratic (MQ) equation system based on ergodic matrix (EM) over a finite field with q elements (denoted as Fq). The system actually implicates a problem which is equivalent to the famous Graph Coloring problem, and therefore is NP complete for attackers. The complexity of bisectional multivariate quadratic equation (BMQE) system is determined by the number of the variables, of the equations and of the elements of Fq, which is denoted as n, m, and q, respectively. The paper shows that, if the number of the equations is larger or equal to twice the number of the variables, and qn is large enough, the system is complicated enough to prevent attacks from most of the existing attacking schemes.
|Title of host publication||Proceedings of the 2010 International Conference on Security and Cryptography (SECRYPT)|
|Number of pages||5|
|Publication status||Published - 1 Jan 2010|
|Event||Proceedings of the 2010 International Conference on Security and Cryptography (SECRYPT) - Athens, 26-28 July 2010|
Duration: 1 Jan 2010 → …
|Conference||Proceedings of the 2010 International Conference on Security and Cryptography (SECRYPT)|
|Period||1/01/10 → …|