Enhancement of data security using circular queue based encryption algorithm

Abstract

Data security is a progressing provocation for designers and Hackers. To battle different attacks by hackers, there is a need for increasingly solid security advancements. In this proposed system, a low complexity circular queue data structure security algorithm can be created. Numerous complicating variable components are used to enhance the quality of this algorithm and make recuperation of original message for hackers, becomes progressively troublesome. These tunable components are the size of the circular queue, the start of the picked keyword letter and the various portrayals of a number are in the Fibonacci manner. All letters ought to be changed over into ASCII binary configuration so as to be utilized by security algorithm in the sensible and shift operations. The outcomes demonstrate that our proposed security algorithm has half low complexity than analyzed multiple circular queues algorithm (MCQA). Fibonacci manner and variable number of difficult factors in this algorithm give adaptability in changing the security of the algorithm as per the conditions. Circular queue is an data structure can be utilized in the data security to make figured message progressively hard to disentangle. For example, a calculation that utilizes the moving and supplanting tasks of bi-section bi-push for round line to expand security. An irregular number was utilized in this algorithm to control the moving between the line and section, in the end this lead to expand the unpredictability of plaintext decrypting.