Enhancing Lightweight Block Cipher Algorithm OLBCA through Decreasing Cost Factor
Sufyan Salim Mahmood Aldabbagh, Imad Fakhri Taha Alshaikhli, Khalid Abdulkareem Al-Enezi, Mohammed Jasem Alyaqoup
Abstract
Sufyan Salim Mahmood Aldabbagh, Imad Fakhri Taha Alshaikhli, Khalid Abdulkareem Al-Enezi, Mohammed Jasem Alyaqoup
Abstract
Lightweight block cipher algorithms are vital for constrained environment. There are three factors should be considered when you design lightweight block cipher algorithm which are security, performance and cost. In this paper, we have improved the cost factor of OLBCA algorithm by decreasing the number of Substitution box (S-box) without a major effect on other factors. Also, we have applied three attacks, which are differential, integral and boomerang attacks. From the result, it can be seen that our proposed algorithm has less cost than other algorithms and still secured.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Lightweight block cipher algorithms are vital for constrained environment. There are three factors should be considered when you design lightweight block cipher algorithm which are security, performance and cost. In this paper, we have improved the cost factor of OLBCA algorithm by decreasing the number of Substitution box (S-box) without a major effect on other factors. Also, we have applied three attacks, which are differential, integral and boomerang attacks. From the result, it can be seen that our proposed algorithm has less cost than other algorithms and still secured.
Key concepts: Block cipher, Computer science, Algorithm, S-box, Block (permutation group theory), Triple DES, Cipher, Factor (programming language)