Normal view MARC view ISBD view

Enhancement of extended vigenere cipher algorithm to increase obscurity and security of local storage data stored in browser in an advice sharing application / John Paul G. Perez, Sean Kevin P. Sigua. 6

By: John Paul G. Perez, Sean Kevin P. Sigua. 4 0 16, [, ] | [, ] |

Contributor(s): 5 6 [] |

Language: Unknown language code Summary language: Unknown language code Original language: Unknown language code Series: ; June 2022.46Edition: Description: 28 cm. 174 ppContent type: text Media type: unmediated Carrier type: volumeISBN: ISSN: 2Other title: 6 []Uniform titles: | | Related works: 1 40 6 []Subject(s): -- 2 -- 0 -- -- | -- 2 -- 0 -- 6 -- | 2 0 -- | -- -- 20 -- | | -- -- -- -- 20 -- | -- -- -- 20 -- --Genre/Form: -- 2 -- Additional physical formats: DDC classification: | LOC classification: | | 2Other classification:

Contents:

Action note: In: Summary: The extended 95x95 Vigenere Cipher Algorithm is a symmetric cryptography algorithm built on the foundations of the Original Vigenere Cipher. The Viginere Cipher Technique is a secure algorithm that encrypts a string of alphabetized text using a succession of interwoven Caesar ciphers. It is classified as a polyalphabetic substitution cipher because it makes use of numerous substitution alphabets. Despite its widespread use, the Vigenere encryption is considered simple, making it extremely easy to crack for outsiders or attackers. To overcome the weakness of the Vigenere cipher used in the previous study, the authors enhanced numerous processes. The existing algorithm did not encrypt special characters or other characters such as emojis. Thus, the authors extended the ASCII table to 190 characters, converting the tabula recta into a 190x190 matrix capable of receiving and encrypting a variety of special characters based on the extended ASCII table. Additionally, due to the additional step provided in the proposed technique, it is effective encrypting characters such as emojis. The algorithm;s vulnerability to attacks such as frequency analysis is due to the repeating nature of the key. To solve this problem, the authors implemented the new key generation process using a a pseudo-random number generator based on XORShift and the Fisher-Yates shuffling algorithm. The results demonstrate that the proposed method, tested through Kasiski attack, frequency analysis, and monobit examination, eliminates the algorithm's key repeating nature, and the generated key may be utilized to encrypt a broader set of characters. The ciphertext has a low index of coincidence (IC) value of 0.11, which similar to a random string and polyalphabetic cipher IV values of 0.038, but not equal to a monoalphabetic cipher with IC values of 0.065. Additionally, the authors proposed a multi-layer cryptographic techniques that included ROT13 with the other proposed methods to further enhance the proposed algorithm. Finally, various use cases demonstrated that the updated algorithm provided increased security by encrypting a more diversified range of characters. Other editions:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes
Comments ( 0 )

Item type	Current location	Home library	Collection	Call number	Status	Date due	Barcode	Item holds
Book	PLM	PLM Filipiniana Section	Filipiniana-Thesis	T QA76.6.P47.2023 (Browse shelf)	Available		FT7763

Total holds: 0

Undergraduate Thesis: (Bachelor of Science in Computer Science) Pamantasan ng Lungsod ng Maynila, 2022. 56

The extended 95x95 Vigenere Cipher Algorithm is a symmetric cryptography algorithm built on the foundations of the Original Vigenere Cipher. The Viginere Cipher Technique is a secure algorithm that encrypts a string of alphabetized text using a succession of interwoven Caesar ciphers. It is classified as a polyalphabetic substitution cipher because it makes use of numerous substitution alphabets. Despite its widespread use, the Vigenere encryption is considered simple, making it extremely easy to crack for outsiders or attackers. To overcome the weakness of the Vigenere cipher used in the previous study, the authors enhanced numerous processes. The existing algorithm did not encrypt special characters or other characters such as emojis. Thus, the authors extended the ASCII table to 190 characters, converting the tabula recta into a 190x190 matrix capable of receiving and encrypting a variety of special characters based on the extended ASCII table. Additionally, due to the additional step provided in the proposed technique, it is effective encrypting characters such as emojis. The algorithm;s vulnerability to attacks such as frequency analysis is due to the repeating nature of the key. To solve this problem, the authors implemented the new key generation process using a a pseudo-random number generator based on XORShift and the Fisher-Yates shuffling algorithm. The results demonstrate that the proposed method, tested through Kasiski attack, frequency analysis, and monobit examination, eliminates the algorithm's key repeating nature, and the generated key may be utilized to encrypt a broader set of characters. The ciphertext has a low index of coincidence (IC) value of 0.11, which similar to a random string and polyalphabetic cipher IV values of 0.038, but not equal to a monoalphabetic cipher with IC values of 0.065. Additionally, the authors proposed a multi-layer cryptographic techniques that included ROT13 with the other proposed methods to further enhance the proposed algorithm. Finally, various use cases demonstrated that the updated algorithm provided increased security by encrypting a more diversified range of characters.

There are no comments for this item.

to post a comment.