cryptography-05-00004.pdf (571.04 kB)
E-ART: a new encryption algorithm based on the reflection of binary search tree
journal contribution
posted on 2023-06-09, 22:56 authored by Bayan Alabdullah, Natalia BeloffNatalia Beloff, Martin WhiteMartin WhiteData 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.
History
Publication status
- Published
File Version
- Published version
Journal
CryptographyISSN
2410-387XPublisher
MDPIExternal DOI
Issue
1Volume
5Page range
1-15Article number
a4Department affiliated with
- Informatics Publications
Full text available
- Yes
Peer reviewed?
- Yes
Legacy Posted Date
2021-02-01First Open Access (FOA) Date
2021-02-01First Compliant Deposit (FCD) Date
2021-01-29Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC