An Efficient Identification Scheme in Standard Model Based on the Diophantine Equation Hard Problem

Recently the diophantine equation hard problem (dehp) was proposed. it is utilized to design a standard identification scheme model. since the computation involves only simple addition and multiplication steps,the efficiency and the time cost are greatly improved as compared to the existing identification schemes. in this paper,we propose a zero knowledge identification scheme based upon the dehp. with the assumption such that dehp is intractable,we provide the security analysis on the impersonation against non-adaptive passive attack (imp-pa) and show that our new proposed scheme is more desirable due to high efficiency in terms of time computation.