Symmetric Encryption using Artificial Neural Network, Binary Tree Traversal, and Interleaving Salting

We have proposed a novel way of symmetric encryption utilizing interleaving salting, Binary Tree traversal, and an Artificial Neural Network in a sequential manner. We have presented the use of an Artificial Neural Network as an invertible(reversible) mathematical function so that decryption of the...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of engineering and advanced technology Vol. 11; no. 6; pp. 96 - 100
Main Authors Jain, Atishay, Gupta, Mihir, Singh, Vibhu Kumar, Dennisan, Aju
Format Journal Article
LanguageEnglish
Published 30.08.2022
Online AccessGet full text

Cover

Loading…
More Information
Summary:We have proposed a novel way of symmetric encryption utilizing interleaving salting, Binary Tree traversal, and an Artificial Neural Network in a sequential manner. We have presented the use of an Artificial Neural Network as an invertible(reversible) mathematical function so that decryption of the encrypted output may be possible. Knowledge of the encryption pipeline, salt, and neural network weights is required for decryption. As the same set of values is required for encryption and decryption, our proposed approach is a type of symmetric-key algorithm. Each user will have a unique key. Thus if a key attributing to a particular user is compromised, the integrity of the data of the remaining users will still be maintained. Our approach can be utilized to encrypt text data such as messages, documents, and letters. The encryption process consists of interleaving salting, creation of binary tree by considering the input as its level order traversal, and passing the preorder and inorder traversal of the constructed binary tree as input to the Artificial Neural Network. The output of the Artificial Neural Network would be the encrypted data. Decryption would require determining the input of an Artificial Neural Network from the output, hence solving multiple sets of linear equations and constructing a binary tree from its preorder and inorder traversal. We have then analyzed the variation of performance with the change in the input string size. The codebase of our proposed approach is publicly available at https://github.com/Atishaysjain/Symmetric-Encryption-using-ANN-and-Binary-Trees.
ISSN:2249-8958
2249-8958
DOI:10.35940/ijeat.F3722.0811622