![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
Hamming Distance Based Substitution Cipher for Coding Optimization
The traditional way of data transmission is to first compress the data & then encrypt it. The proposed algorithm suggests a reversing the order of these steps without loss of information. Polygram substitution method is adopted for encryption & hamming distance of codeword is taken into account for compression techniques. Bit stream is chopped into either Four or eight bits each, and a minimized code is found for each of the chunks by first encrypting it & then compressing. The proposed algorithm can be used for various file formats such as images, videos and text. A full cycle for the proposed algorithm is to compress a file, encrypt it, decrypt it, and finally decompress it back identically to the original file.
Keywords
Compression, Decompression, Substitution, Encryption, Decryption
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 154
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 1