Pengamanan Data Tekstual dengan Kombinasi Vigenere Cipher dan Caesar Cipher
Abstract
Problems in data security is an important aspect in maintaining data storage, especially data stored in digital form. This is due to very rapid progress in the field of computer science with the open-system concept that has been widely used, so that this can make it easier for someone to destroy data, especially data stored in digital form without having to be known by the data custodian. In this case the researcher found a problem in using one algorithm, namely the Caesar cipher in data security, where there is a Brute force attack that tries all possible key combinations to crack a password. In the context of the Caesar Cipher, brute force can be used to try all possible shifts of letters and find a key that produces a plausible decrypted text. This study aims to maximize the security of textual data by combining two algorithms in it, in which the algorithm used is the Vigenere Cipher and the Caesar Cipher. The result of this research is that textual data that is secured becomes more difficult to understand by third parties who may want to manipulate data.
Keywords : Textual Data, Vigenere Cipher, Caesar Cipher
This work is licensed under a Creative Commons Attribution 4.0 International License.
The Authors submitting a manuscript do so on the understanding that if accepted for publication, the copyright of the article shall be assigned to JNATIA (Jurnal Nasional Teknologi Informasi dan Aplikasinya) as the publisher of the journal. Copyright encompasses exclusive rights to reproduce and deliver the article in all forms and media, as well as translations. The reproduction of any part of this journal (printed or online) will be allowed only with written permission from JNATIA (Jurnal Nasional Teknologi Informasi dan Aplikasinya). The Editorial Board of JNATIA (Jurnal Nasional Teknologi Informasi dan Aplikasinya) makes every effort to ensure that no wrong or misleading data, opinions, or statements be published in the journal.
This work is licensed under a Creative Commons Attribution 4.0 International License.