An enhancement of the structure of burrows-wheeler compression algorithm applied in text encryption / 6
6
Dimalibot, Vienna Mari C.
-
-
- 63 pp. 28 cm.
-
-
-
-
- .
- .
- 0 .
- .
- 0 .
Thesis: (BSCS major in Computer Science)-Pamantasan ng Lungsod ng Maynila, 2019.
5
ABSTRACT: This study is about enhancement of the Structure Burrows-Wheeler Compression Algorithm, also known as BWCA. The algorithm is composed of three transformations or sub-algorithms which are the Burrows-Wheeler Transform, Move-to-Front Algorithm or MTF and lastly, the Run-Length Encoding or RLE which are performed in this order in compression and vice versa in decompression. The algorithm performs well and better with frequent characters compared to other algorithms because of its efficiency. Although, the BWCA does not perform well with input text that have less redundant characters or doesn't have patterns. The researcher improved the Burrows-Wheeler Compression Algorithm's compression ration by applying the hexadecimal to decimal conversion in both MTF and RLE. Meanwhile, the jump search algorithm is used in MTF to perform faster in compressing encrypted text files. The study can be useful to future researchers who are interested in performing compression after encryption and to those who are studying on how to enhance burrows-wheeler compression algorithm. Also, they can apply the enhanced BWCA on different systems that requires high security and have limited storage of files. With the enhanced BWCA, the security of the systems files would be higher because of the processing of compression then encryption that will make the hackers have a hard time decoding the files.