Next Article in Journal
Acknowledgment to Reviewers of Cryptography in 2020
Previous Article in Journal
On the Possibility of Classical Client Blind Quantum Computing
Article

E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree

1
Department of Informatics, University of Sussex, Falmar BN1 4GE, UK
2
Computer Science Department, Princess Nourah Bint Abdul Rahman University, Riyadh 11543, Saudi Arabia
*
Author to whom correspondence should be addressed.
Received: 16 December 2020 / Revised: 18 January 2021 / Accepted: 26 January 2021 / Published: 29 January 2021
Data security has become crucial to most enterprise and government applications due to the increasing amount of data generated, collected, and analyzed. Many algorithms have been developed to secure data storage and transmission. However, most existing solutions require multi-round functions to prevent differential and linear attacks. This results in longer execution times and greater memory consumption, which are not suitable for large datasets or delay-sensitive systems. To address these issues, this work proposes a novel algorithm that uses, on one hand, the reflection property of a balanced binary search tree data structure to minimize the overhead, and on the other hand, a dynamic offset to achieve a high security level. The performance and security of the proposed algorithm were compared to Advanced Encryption Standard and Data Encryption Standard symmetric encryption algorithms. The proposed algorithm achieved the lowest running time with comparable memory usage and satisfied the avalanche effect criterion with 50.1%. Furthermore, the randomness of the dynamic offset passed a series of National Institute of Standards and Technology (NIST) statistical tests. View Full-Text
Keywords: security; cryptography; dynamic key; binary tree; ASCII security; cryptography; dynamic key; binary tree; ASCII
Show Figures

Figure 1

MDPI and ACS Style

Alabdullah, B.; Beloff, N.; White, M. E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree. Cryptography 2021, 5, 4. https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography5010004

AMA Style

Alabdullah B, Beloff N, White M. E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree. Cryptography. 2021; 5(1):4. https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography5010004

Chicago/Turabian Style

Alabdullah, Bayan, Natalia Beloff, and Martin White. 2021. "E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree" Cryptography 5, no. 1: 4. https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography5010004

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop