Date Added: Mar 2012
Scrambled Burrows-Wheeler transform is an attempt to combine privacy (encryption) and data compression. The authors show that the proposed approach is insecure. They present chosen plaintext and known plaintext attacks and estimate their complexity in various scenarios. The Burrows-Wheeler Transform (BWT) is a commonly used transform in loss-less compression algorithms. The BWT does not compress the data itself, instead it is usually the first step in a sequence of algorithms transforming an input data into compressed data. The most prominent example of BWT-based compression is bzip2 program, which uses basically the following sequence of algorithms: the BWT, the Move-To-Front transform (MTF), and Huffman coding.