DocumentCode :
541920
Title :
BMQE system: A MQ equations system based on ergodic matrix
Author :
Zhou, Xiaoyi ; Ma, Jixin ; Du, Wencai ; Zhao, Bo ; Petridis, Miltos ; Zhao, Yongzhe
fYear :
2010
fDate :
26-28 July 2010
Firstpage :
1
Lastpage :
5
Abstract :
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.
Keywords :
Complexity theory; Galois fields; Polynomials; Public key cryptography; Bisectional; Ergodic Matrix; Fixing Variables; Multivariate Quadratic; NP-hard;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Security and Cryptography (SECRYPT), Proceedings of the 2010 International Conference on
Conference_Location :
Athens
Type :
conf
Filename :
5741641
Link To Document :
بازگشت