Cryptographic algorithm using data structure using C concepts for better security

Abstract

For secure communication we always use different security algorithms e.g. Caesar cipher, modified Caesar cipher, IDEA, AES, RSA algorithm etc. and in data structures using C we have Linked list, stack, queue, tree and graph. In graph we have graph traversal i.e. BFS (Breadth First Search) or DFS (Depth First Search). This paper presents the new technique for security which is combination of Caesar Cipher and graph traversal, Binary search tree together then security will be much higher than only using Caesar cipher or graph traversal or binary search tree.