Author(s): Firas Sameer Ashour

Abstract: It is essential to maintain users' rights to privacy, confidentiality, and integrity of their information. Cryptography is the only technology that allows users to protect and guarantee their rights. As such, encryption is the most important policy to be employed by users to make it virtually impossible for attackers to decipher transmitted messages. This research has two major objectives: In Part 1, we will test six traditional encryption methods to determine which produces the greatest amount of complexity for an attacker attempting to decipher an identical plain-text message. The six traditional encryption algorithms to be tested include: Beaufort, Garsfeld, Porta, Trithemuis, Autokey, and Vigenère. In addition to testing the encryption methods, we will analyze the results using techniques such as Entropy, Histograms, and Autocorrelation. In Part 2, we will build upon our findings from Part 1 to develop and test two hybrid ciphering models utilizing Vigenère to enhance the security of the Data Encryption Standard (DES). Each trial will have three cases, representing three scenarios. For example, in the first trial, we will test the Vigenère algorithm used alone to encrypt plaintext, the ECB DES algorithm used alone to encrypt plaintext, and a combination of both algorithms to create a multilevel encrypted ciphertext. In the second trial, we will use the same cases, however, we will add the CBC DES algorithm to the previous case to create another hybrid ciphering model. We expect to find that all six of the classical encryption algorithms have differing levels of effectiveness, and that the Vigenere method is the most complex and therefore the most successful. Furthermore, when the Vigenere method is used in conjunction with additional methods, such as the DES, the overall complexity of the encryption and the level of security provided to the user can be increased.

DOI: 10.33545/26633582.2025.v7.i2d.235

Pages: 318-334 | Views: 92 | Downloads: 33

Download Full Article: Click Here