Performance Analysis of Classical Encryption Algorithms in encrypting Database Transactions

Abstract

Database Transactions are pieces of information which holds operations that are performed on the database. They became a very critical issue that should be carefully stored and secured while they are under process, and during their existence in memory. In this research, encryption was introduced as a solution for securing database transactions and text data that it holds in memory. The main objective is that to measure the performance for three algorithms: Simple Substitution, Caesar, and Periodic Permutation respectively. Performances are measured here in terms of time, memory usage and CPU consumption. Final results we had obtained defined clearly – in terms of time – that in large data processing, Caesar and periodic Permutation had the optimal performance while Caesar had recorded the best score than the other two in case of small data sizes. On the other hand, and in terms of memory usage, simple substitution algorithm had recorded the smallest size used to perform in small-sized data, but in large data, Caesar had won the competition over them. From CPU resource point of view, Simple Substitution had recorded the least efforts of CPU in small-sized data and the same in large-sized data, while Caeser had consumed largest CPU efforts in large as well as small sized data. All in all, this experiment can be based to enable Database Designers to decide which algorithm is the suitable one according to type of database transaction waiting for processing, as well as length of data that it consists of.