Abstract

Implementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.

Highlights

  • Numerous business fields have computerized the majority of their information and applications [1]

  • The security mechanism of a database management system (DBMS) must adopt a security technique of information encryption to ensure the protection of sensitive information [2]

  • The determinants of the initial keys will be: Det0 = 116 Det1 = 117 Det2 = 104 Det1 that represents Group1 is selected to be MAXDet of the first round. This factor will play a great role in Transposition and Folding phases, as will be shown, which represents an enhancement to the TSFS algorithm that increased the strength of the encryption and decryption processes

Read more

Summary

Introduction

Numerous business fields have computerized the majority of their information and applications [1]. The determinants of the initial keys will be: Det0 = 116 Det1 = 117 Det2 = 104 Det that represents Group is selected to be MAXDet of the first round This factor will play a great role in Transposition and Folding phases, as will be shown, which represents an enhancement to the TSFS algorithm that increased the strength of the encryption and decryption processes. The first block is 'Winter 15th Feb.', and by using the three keys that are generated in the example above and computing their Det and the MAXDet for the first round (of the ten rounds), the encryption process of the algorithm is illustrated in Fig. 6: Transposition: TSFS algorithm uses three directions of zigzag diagonal transposition that rearrange matrix elements.

Results and Discussion
Conclusions
Full Text
Paper version not known

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.