Substitution-boxes based on Binary Tree built by Variants of Depth First Search
| Main Authors: | Mehwish Sarwar, Dr. Nasir Siddiqui |
|---|---|
| Format: | Article Journal |
| Bahasa: | eng |
| Terbitan: |
, 2021
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/5668972 |
Daftar Isi:
- Abstract—In today’s age maximum communication takes place through internet and online channels. Therefore, securing of data has become even more vital and to fulfil this purpose data is encrypted in an unreadable form known as cryptography. S-box is established to obtain this purpose because it provides data obscurity, dependability and power to withstand against attacks from illegal resources. This paper shows the construction of resilient and robust S-boxes based on binary tree build by variants of Depth First Search. We tested our S-boxes using different analyses such as algebraic, statistical and also for image encryption. Index Terms—Tree traversal, binary tree, Depth First Search, variants of DFS, adjacency matrix, Substitution box