Robustness Analysis of Zero-Knowledge Proofs using RSA for IoT Devices

For the robustness analysis of the security mechanism, the time complexity and asymptotic security of the algorithm are analysed and used. Therefore, this work examines the resilience of the zero-knowledge proofs (ZKP) technique utilising the RSA (Rivest, Shamir, and Adleman) problem. The result of this research is a better option for Internet of Things (IoT) devices to address key security challenges (attacks on confidentiality, authentication, integrity, and availability). The zero-knowledge proofs technique has been used with the RSA problem. It is analysed and compared with Elliptic Curve Cryptography (ECC) to see how they are correlated with each other and whether ZKP using the RSA problem can address the security issues of IoT devices in a better way or not. The final correlation result shows that both ZKP using RSA for Pollard's rho algorithm and ECC are highly correlated with one another. Asymptotic time complexity and the graph of ZKP using RSA for Pollard's rho algorithm and ECC clearly show that RSA for Pollard's rho algorithm has better time complexity than ECC. So, it can address the security issues required by IoT devices.