Abstract

Virtually all of today’s organizations store their data in huge databases to retrieve, manipulate and share them in an efficient way. Due to the popularity of databases for storing important and critical data, they are becoming subject to an overwhelming range of threats, such as unauthorized access. Such a threat can result in severe financial or privacy problems, as well as other corruptions. To tackle possible threats, numerous security mechanisms have emerged to protect data housed in databases. Among the most successful database security mechanisms is database encryption. This has the potential to secure the data at rest by converting the data into a form that cannot be easily understood by unauthorized persons. Many encryption algorithms have been proposed, such as Transposition-Substitution-Folding-Shifting encryption algorithm (TSFS), Data Encryption Standard (DES), and Advanced Encryption Standard (AES) algorithms. Each algorithm has advantages and disadvantages, leaving room for optimization in different ways. This paper proposes enhancing the TSFS algorithm by extending its data set to special characters, as well as correcting its substitution and shifting steps to avoid the errors occurring during the decryption process. Experimental results demonstrate the superiority of the proposed algorithm, as it has outperformed the well-established benchmark algorithms, DES and AES, in terms of query execution time and database added size.

Highlights

  • The tremendous development of technology and data storage leads organizations to depend on database systems

  • This paper proposes enhancing the Transposition-Substitution-Folding-Shifting encryption algorithm (TSFS) algorithm by extending its data set to special characters, as well as correcting its substitution and shifting steps to avoid the errors occurring during the decryption process

  • In order to achieve a high level of security, the complexity of encryption algorithms should be increased with minimal damage to database efficiency, ensuring performance is not affected

Read more

Summary

INTRODUCTION

The tremendous development of technology and data storage leads organizations to depend on database systems. The TSFS algorithm provides a high degree of security, using a number of features It supports only numbers and alphabetic characters that are not enough to protect different types of sensitive data. Another deficit of the TSFS algorithm is during the substitution and shifting processes where some errors occur during the decryption process. This paper provides a secure and efficient encryption method that encrypts only sensitive data without using special hardware It enhances TSFS algorithm by extending its data set to special characters, and corrects substitution and shifting processes, by providing more than one modulo factor and four 16-arrays respectively in order to avoid the error that occurs during the decryption steps.

RELATED WORK
Substitution
Folding
Shifting
IMPLEMENTATION
Translator Class
Key Class
COMPARATIVE STUDY
Experiment Setup
Evaluation Metrics
Results and Discussion
CONCLUSION AND FUTURE WORK

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.