Redirigiendo al acceso original de articulo en 17 segundos...
Inicio  /  Algorithms  /  Vol: 15 Par: 10 (2022)  /  Artículo
ARTÍCULO
TITULO

Computational Complexity of Modified Blowfish Cryptographic Algorithm on Video Data

Abidemi Emmanuel Adeniyi    
Sanjay Misra    
Eniola Daniel and Anthony Bokolo    
Jr.    

Resumen

Background: The technological revolution has allowed users to exchange data and information in various fields, and this is one of the most prevalent uses of computer technologies. However, in a world where third parties are capable of collecting, stealing, and destroying information without authorization, cryptography remains the primary tool that assists users in keeping their information secure using various techniques. Blowfish is an encryption process that is modest, protected, and proficient, with the size of the message and the key size affecting its performance. Aim: the goal of this study is to design a modified Blowfish algorithm by changing the structure of the F function to encrypt and decrypt video data. After which, the performance of the normal and modified Blowfish algorithm will be obtained in terms of time complexity and the avalanche effect. Methods: To compare the encryption time and security, the modified Blowfish algorithm will use only two S-boxes in the F function instead of the four used in Blowfish. Encryption and decryption times were calculated to compare Blowfish to the modified Blowfish algorithm, with the findings indicating that the modified Blowfish algorithm performs better. Results: The Avalanche Effect results reveal that normal Blowfish has a higher security level for all categories of video file size than the modified Blowfish algorithm, with 50.7176% for normal Blowfish and 43.3398% for the modified Blowfish algorithm of 187 kb; hence, it is preferable to secure data and programs that demand a high level of security with Blowfish. Conclusions: From the experimental results, the modified Blowfish algorithm performs faster than normal Blowfish in terms of time complexity with an average execution time of 250.0 ms for normal Blowfish and 248.4 ms for the modified Blowfish algorithm. Therefore, it can be concluded that the modified Blowfish algorithm using the F-structure is time-efficient while normal Blowfish is better in terms of security.

 Artículos similares

       
 
Yu Chen, Jianwan Ding, Yu Chen and Dong Yan    
The introduction of a dynamic model in robot trajectory tracking control design can significantly improve its trajectory tracking accuracy, but there are many uncertainties in the robot dynamic model which can be dealt with through robust control and ada... ver más
Revista: Applied Sciences

 
Radoslaw Piotr Katarzyniak, Grzegorz Popek and Marcin Zurawski    
This article presents a model of an architecture of an artificial cognitive agent that performs the function of generating autoepistemic membership statements used to communicate beliefs about the belonging of an observed external object to a category wi... ver más
Revista: Applied Sciences

 
George Tzoumakis, Konstantinos Fotopoulos and George Lampeas    
Future liquid hydrogen-powered aircraft requires the design and optimization of a large number of systems and subsystems, with cryogenic tanks being one of the largest and most critical. Considering previous space applications, these tanks are usually st... ver más
Revista: Aerospace

 
Falah Amer Abdulazeez, Ismail Taha Ahmed and Baraa Tareq Hammad    
A significant quantity of malware is created on purpose every day. Users of smartphones and computer networks now mostly worry about malware. These days, malware detection is a major concern in the cybersecurity area. Several factors can impact malware d... ver más
Revista: Applied Sciences

 
Haojie Wang, Pingqing Fan, Xipei Ma and Yansong Wang    
The intelligent identification of coal gangue on industrial conveyor belts is a crucial technology for the precise sorting of coal gangue. To address the issues in coal gangue detection algorithms, such as high false negative rates, complex network struc... ver más
Revista: Algorithms