Cryptographic Techniques using Binary Tree and Tree Traversal
M Shanmugam Shoba · Zenodo (CERN European Organization for Nuclear Research) · 2017
In 21st century one of the most emerging problems is Data Security. 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 a new idea for Data encryption and decryption in order to provide security for data. Also it provides 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.