# Computational Complexity of Modified Blowfish Cryptographic Algorithm on Video Data
###### Abstract
In the proposed technique, both encryption and decryption occurred in the Feistel function in round one; an additional key (KEY2) of a one-byte length was utilized rather than a single key in the encryption operation. Furthermore, the suggested modified Blowfish method uses five Boxes instead of four; the additional key (KEY2) is chosen at random from the additional Sbox5, while the fifth Sbox is constructed in GF(28), and it is variable to increase the proposed algorithm's complexity. [PERSON], [PERSON], and [PERSON] [26] proposed a revised Blowfish technique that can handle 128-bit blocks. Although being recognized as an unbreakable method, the Blowfish algorithm has been unsuitable for some applications due to limited block length compatibility. A unique revised version of the Blowfish encryption system is developed in this work to accommodate a 128-bit block size input utilizing a flexible choice encryption system and decreased encrypted function operations through randomly selected rounds. [PERSON], [PERSON], and [PERSON] [27] used a revised Blowfish algorithm technique for information security in cloud computing. Cloud computing is a common issue associated with data and information security. The computational complexity was tested using a modified Blowfish Technique employing the Shuffle Strategy. [PERSON], [PERSON], and [PERSON] [28] improved and compared the Blowfish method in terms of encryption quality, correlation coefficients, key sensitivity testing, and output file size. By combining the XOR and addition utilized in the original technique, the '\(t\)' function was updated. Four different scenarios were generated and assessed. The findings of all the tests conducted on these scenarios all pointed to the same conclusion: the updated algorithm's security in various cases makes the original Blowfish method more compact and secure than before. [PERSON] and [PERSON] [29] investigated the efficacy of Blowfish and AES algorithms. Their studies were carried out on a Pentium P4.2.4 GHz processor with 2 GB RAM. The trials were repeated numerous times to ensure that the findings were consistent and valid for comparing the various methods. To evaluate the performance of the encryption methods, the study employed the encryption time, decryption time, CPU process time, CPU clock cycles, and battery metrics. In virtually all the test situations, the results reveal that Blowfish outperforms AES. There was no discernible difference between base64 and hexadecimal encoding schemes. It was discovered that Blowfish is good for text-based encryption, whilst AES is better for picture encryption. The study also discovered that changing the key size of the AES algorithm affects its performance. Overall, it was determined that AES can be utilized in situations requiring high security, whereas Blowfish can be utilized in situations requiring high-performance. A summary of the important works is given in Table 1.  
This study consists of five sections. The next section describes the materials and methods used in the study. Section 3 presents the results. Section 4 presents a discussion, while Section 5 concludes the study. \begin{table}
\begin{tabular}{c c c c c} \hline \hline
**S/N** & **Authors** & **Algorithms** & **Parameter** & **Outcome** & **Gap** \\ \hline \multirow{3}{*}{1} & [PERSON], [PERSON], and [PERSON] [16] & \multirow{3}{*}{DES and Blowfish Application (WSN)} & Wireless Sensor Network Application (WSN) & Blowfish outperforms DES in terms of speed & The algorithms were tested on small WSN data. \\  & & Blowfish using & & The Random Key Generator was used to & The study only tests the enhanced Blowfish on \\  & [PERSON] [17] & Generator & & algorithm encryption key & image data \\ \hline \hline \end{tabular}
\end{table} 
Table 1: Summary of Literature reviews.