Combination of Cryptography Algorithm Knapsack and Run Length Enconding (RLE) Compression in Treatment of Text File. (July 2020)

• Record Type: Journal Article
• Authors: Marto Hasugian, Paska; Barita Nauli Simangunsong, Pandi; Iqbal Panjaitan, Muhammad; Wahyuni, Dewi; Fadillah Rezky, Syarifah
• Is Part Of: Journal of physics. Volume 1573(2020)
• Publication Date: 2020-07
• Subjects: Cryptography -- Knapsack -- RLE; Physics -- Congresses; 530.5
• DOI: 10.1088/1742-6596/1573/1/012017
• Languages: English
• ISSNs: 1742-6588

Abstract

Abstract: The Knapsack algorithm cryptographic method is asymmetric cryptography in which the encryption key is different from the decryption key. In addition to text file security issues, the issue of the size of a text file is also a consideration. Large text files can be compressed by doing the compression process. Run Length Encoding (RLE) algorithm is an algorithm that reduces the size of a text file, if the text has a lot of repetition of characters. The combination of Knapsack and RLE algorithms can guarantee Text files cannot be seen by unauthorized users and can guarantee text files can be stored in low capacity media files. In this study, the authors made a combination of knapsack and RLE algorithm in text files. In the Knapsack algorithm there will be an increase in the size of the text file, this can be seen in the example of a case where the size of the plaintext (the original message) is 9 bytes, then after the encryption process the text file size becomes 7 bytes. Because of that the use of a combination of encryption and data compression is better because the file becomes smaller than the combination of data compression and encryption. Plaintext that has a lot of repetition of characters will be well compressed.