Binary Tree-Based Asymmetric Moderate Algorithm for Secured DNS

Abstract

AbstractWith the advent of recent advancements in different Web technologies, domain name system (DNS) has become vital for the entire network infrastructure. Still, it lacks robust security mechanism implementation for ensuring integrity and authentication of information. The extensions to the DNS for implementing these services are represented with the help of cryptanalytic digital signatures. Keys associated with DNS names will be retrieved to support other protocols also. In addition to that, security extensions provide authentication of DNS protocol transactions also. In this research work, the authors have proposed a moderate algorithm, a stream cipher algorithm, which converts plaintext into cipher text with stringent levels of time complexity in order to produce security by combining the concept of each the digital signature and asymmetric key (public key) cryptography. Here, the public key is used instead of the private key with a combination of the SHA-512 algorithm to compress the message (text file) and pseudo-random number generator (PRNG) algorithm for generating further public and private keys. The proposed encryption algorithm encrypts the data using ASCII values of the characters and properties of binary trees. The authors have evaluated the complexity of the proposed moderate method and found it satisfactory with the O(n) nature of time complexity theoretically. Authors have shown the performance of both encryption and decryption algorithms with the help of figures and graphs also.KeywordsDNSSHA-512RC4Message security