A data structure encryption algorithm based on circular queue to enhance data security
Ali Albu-Rghaif, Abbood Kirebut Jassim, Ali J. Abboud · 2018
Data security is an ongoing challenge for developers and hackers. To combat different attacks by hackers, there is a necessity for more reliable security technologies. In this research, a low complexity circular queue data structure security algorithm is developed. Employing multiple complicating variable factors is the strength of this algorithm and makes recovery of original message by attackers more difficult. These tuneable factors are the size of the circular queue, the beginning of the chosen keyword letter and the multiple representations of a number in the Fibonacci format. All letters should be converted into ASCII binary format in order to be used by security algorithm in the logical and shift operations. The results show that our proposed security algorithm has 50% low complexity than compared multiple circular queues algorithm (MCQA). In addition, the Fibonacci format and variable number of challenging factors in this algorithm provide flexibility in changing the security of the algorithm according to the circumstances.