Robustness Analysis of Zero Knowledge Proofs using Diffie Hellman Problem

By the means of asymptotic security of cryptographic security mechanism we can get knowledge about efficiency and tolerable features against various type of attacks compromised on it. Analytical study about how zero-knowledge proofs can be used with Diffie Hellman problem (DHP) are presented in this research. One of the better algorithms of discrete logarithm problem which is suggested by Henry for zero knowledge proofs is suitable for DHP problem for the robustness analysis of it. The efficiency of discrete logarithm algorithm for DHP problem and integer factorization problem are analyzed and made comparison between them and covariance and correlation between their asymptotic functions is obtained as final result which clearly give us idea about strong relationship between each other and correlation factor between them is high, so they are similar in nature.