Performance analysis of AES, DES and Blowfish cryptographic algorithms on small and large data files

• Published in: International journal of information technology (Singapore. Online) Vol. 11; no. 4; pp. 813 - 819
• Main Author: Patel, Kuntal
• Format: Journal Article
• Language: English
• Published: Singapore Springer Singapore 01.12.2019; Springer Nature B.V
• Subjects: Algorithms; Applications programs; Computer Communication Networks; Computer Science; Computer Systems Organization and Communication Networks; Cryptography; Encryption; Information systems; Information Systems and Communication Service; Management of Computing and Information Systems; Original Research; Scientific papers; Software Engineering/Programming and Operating Systems; DES; Symmetric key and asymmetric key; Data Security; Encryption; Cryptography; Decryption; AES; Blowfish
• ISSN: 2511-2104; 2511-2112
• DOI: 10.1007/s41870-018-0271-4

The value of data stored on digital platforms are growing very rapidly. Also, most of the information systems are networked based having lots of resources like data, software applications and business logics which are always susceptible to attacks. To provide security to such information systems, many cryptographic algorithms are available. This paper focuses of three such widely popular cryptographic algorithms: AES, DES and Blowfish. These are well known symmetric key cryptographic algorithms useful in providing security to IT systems. The main objective of research paper is to analyze the performance of these algorithms on small and large data files. Performance comparison is based on execution time and memory used by these algorithms during the implementation. Experimental results and graphical reports make clear which algorithm is more suitable for small and large data files. Analytical results also describes which algorithm is more suitable for time and memory constraint systems.