Generation of symmetric sharing key using ABC conjecture
Amar Kumar Mishra, Shefalika Ghosh Samaddar · 2017
The security of data is the primary concern in the public network. In public key cryptography we have to generate a symmetric sharing key for encryption and decryption of message. There are various protocols are developed for the same such as Diffie-Hellmen, RSA, Rabin cryptosystem, Elagmal cryptosystem, ECC, etc. But these protocols are vulnerable to different types of attacks. In this paper we modified the Diffie-Hellmen protocol and tried to make it more robust. A modification of Diffie-Hellmen protocol has been done using the concept of abc conjecture. The proposed algorithm passes the required parameter using Diffie-Hellmen key exchange protocol and further satisfy the condition of abc conjecture. The developed protocol has used the idea of Diffie-Hellmen protocol but the scalability and robustness of the modified protocol is better than Diffie-Hellmen protocol by design but poor in timing complexity by choice.