Randomized Key Exchange Protocol Implementation for Internet of Things Application
Syed Jahanzeb Hussain Pirzada, Zohaib Wahab Memon, Tongge Xu, Liu Jianwei
Abstract
Syed Jahanzeb Hussain Pirzada, Zohaib Wahab Memon, Tongge Xu, Liu Jianwei
Abstract
Recently, the security of public key security algorithms have been research extensively; besides, the utilization of public key cryptography requires key exchange protocol. The security of key exchange protocol is significant as it transmits the key and therefore, the security of public key algorithms depend on the security of key exchange protocol. In addition, the concept of Perfect Forward Secrecy (PFS) is evolving with the number of security threats. Traditionally, the key exchange protocols use asymmetric and symmetric to exchange session keys, which consumes more hardware resources and time for implementation. Moreover, these encryption based key exchange protocols requires several messages to exchange before sending the key, which cause delay in key exchange and consume bendwidth ineffciently. This work provides a new key exchange protocol with randomized initialization vector and advanced features for PFS. The proposed algorithm is simple and faster as compared to previous algorithms, the security of proposed algorithm is comparable to One Time Pad (OTP) algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Recently, the security of public key security algorithms have been research extensively; besides, the utilization of public key cryptography requires key exchange protocol. The security of key exchange protocol is significant as it transmits the key and therefore, the security of public key algorithms depend on the security of key exchange protocol. In addition, the concept of Perfect Forward Secrecy (PFS) is evolving with the number of security threats. Traditionally, the key exchange protocols use asymmetric and symmetric to exchange session keys, which consumes more hardware resources and time for implementation. Moreover, these encryption based key exchange protocols requires several messages to exchange before sending the key, which cause delay in key exchange and consume bendwidth ineffciently. This work provides a new key exchange protocol with randomized initialization vector and advanced features for PFS. The proposed algorithm is simple and faster as compared to previous algorithms, the security of proposed algorithm is comparable to One Time Pad (OTP) algorithm.
Key concepts: Computer science, Key exchange, Security association, Key (lock), Key-agreement protocol, Oakley protocol, Forward secrecy, Cryptographic protocol