文章基本信息

标题：Simultaneous Data Compression and Encryption
本地全文：下载
作者：T.SubhamastanRao ; M.Soujanya ; T.Hemalatha 等
期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2011
卷号：2
期号：5
页码：2369-2374
出版社：TechScience Publications
摘要：Data compression is known for reducing storage and communication costs. It involves transforming data of a given format, called source message to data of a smaller sized format called codeword. Data encryption is known for protecting formation from eavesdropping. It transforms data of a given format, called plaintext, to another format, called cipher text, using an encryption key. The major problem existing with the current compression and encryption methods is the speed, i.e. the processing time required by a computer. To lessen the problem, combine the two processes into one. The basic idea of the combining the two processes is to add a pseudo random shuffle into a data compression. The aim behind the shuffling process is to get the different Huffman table for the original Huffman tree by shuffling nodes in the tree. Using the numbers generated by pseudo random generator, nodes in the Huffman tree are shuffled. After the encryption we will get one mapping Huffman table, which is not identical to the original. Finally this table only will send across the network. Once the Huffman table is encrypted no one having the decompression module can decrypt it. So in this new algorithm compression and encryption is done simultaneously.
关键词：Encryption;Decryption;Compression;Datacompre;ssion;Decompression;Huffman compression.l