EconPapers    
Economics at your fingertips  
 

A Review of the Blowfish Algorithm Modifications in Terms of Execution Time and Security

Raghad Abdul Hadi Abdul Qader ()

Technium, 2022, vol. 4, issue 1, 89-101

Abstract: Data has become increasingly popular for advanced digital content transmission. Researchers are concerned about the protection of data. The transmission of digital data over a network has made multimedia data vulnerable to various threats, including unauthorized access and network hacking. As a result, the data must be protected with encryption methods based on symmetric encryption algorithms, which will ensure the data security. The Blowfish encryption algorithm is one of the most well-known cryptographic algorithms. However, each of the current algorithms has its own set of advantages and disadvantages. However, there are several drawbacks to using this algorithm, including complex computational operations, fixed (S-Box) and pattern issues, which can arise while dealing with more complex data, including texts. Many academics have sought to increase the algorithm's efficiency. The modifications to the Blowfish algorithms provided by researchers in prior works are summarized in this publication.

Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://techniumscience.com/index.php/technium/article/view/7452/2734 (application/pdf)
https://techniumscience.com/index.php/technium/article/view/7452 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tec:techni:v:4:y:2022:i:1:p:89-101

DOI: 10.47577/technium.v4i9.7452

Access Statistics for this article

Technium is currently edited by Scurtu Ionut Cristian

More articles in Technium from Technium Science
Bibliographic data for series maintained by Ana Maria Golita ().

 
Page updated 2025-03-20
Handle: RePEc:tec:techni:v:4:y:2022:i:1:p:89-101