Premium
An efficient mechanism to generate dynamic keys based on genetic algorithm
Author(s) -
Chunka Chukhu,
Goswami Rajat Subhra,
Banerjee Subhasish
Publication year - 2018
Publication title -
security and privacy
Language(s) - English
Resource type - Journals
ISSN - 2475-6725
DOI - 10.1002/spy2.37
Subject(s) - computer science , key (lock) , confidentiality , secrecy , computer network , block (permutation group theory) , information theoretic security , genetic algorithm , distributed computing , computer security , algorithm , mathematics , machine learning , geometry
Sharing information and providing services are the key factors of the computer network. Due to publically in nature of computer network and improvement of various technology in the field of computer science, the chances of hacking and licking the confidentiality of shared messages have increased exponentially. Hence, preventing such possibilities and maintaining the confidentiality over the computer network has become the primary and forth most requirement. According to Shannon's perfect secrecy, the confidentiality of shared information can only be maintained if the size of the key is greater or equal to the length of the message. In this paper, an efficient mechanism has been proposed to establish the initial secret key based on the genetic algorithm (GA) and variable key generation mechanism, which helps to change the keys after selection of the initial key for each new block of data transmission to make the key size as long as the size of the original message. To prove the efficiency of the proposed scheme, a comparative studies with the existing related schemes have also been carried out later in this paper.