An Efficient encryption using Data compression towards Steganography,introducing arithmetic coding.
A Seminar on
An Efficient Encryption using Data Compression towards
Dept. of Computer Science & Engineering
Review of Literature
Block Diagram of Proposed System
Data transmission must be secure enough
to be used in channel
medium without any loss and tampering of data. Secure transmission of
data is a key issue in the field of information technology.
Data sent must be in compact way. Compactness is achieve through
data compression, which reduces storage space or transmission capacity
of the information.
Data compression is formally called as bit rate reduction. Which
focuses on reducing the number of bits representing the secret
Types of data compression
Review of literature
Babu and V.
It makes an use of
occurrence of each
Use tree structure
and top down
Each symbol is
variable length code
not that much
A Hybrid Approach
It replaces strings
of characters with
Run Length Encoding
Introduction of Bit
Stuffing for efficient
• Uses LSB
bits are counted
single value with
when size of the
data increases, one
Arithmetic coding compression technique is used. It converts
stream of plaintext into single floating point number and range of
floating point number is between [0,1].
It has high compression ratio than any other compression
It is based on probability of each character. Calculated as
Where P= probability of character
C= Occurrence of the character
L= Length of the plaintext
Block diagram of proposed system
Fig. 2 Process at Sender side
Fig.3 Process at Receiver side
Compactness is achieved using Data compression technique, that is by
using arithmetic coding. It provide some amount of security to secret data.
But in proposed system additional security is provided to data by using
Encryption technique , which makes an use of any cryptographic algorithm
and it is applied on the compressed data.
Provides confidentiality and secrecy to data.
Thus the proposed system can provides an efficient manner for
the transmission of the secret information from one authorized user
to the other.
From the study of literature, Compressed data required less
storage capacity, so more amount of information can be hided inside
 Jiantao Zhou, Xianming Liu, Oscar C. Au, Fellow, and Yuan Yan Tang,
Fellow, “Designing an Efficient Image Encryption-Then-Compression System
via Prediction Error Clustering and Random Permutation”, IEEE Transactions
on information forensic and security,vol.9,No.1,january 2014.
 M. Gomathymeenakshi, S. Sruti, B. Karthikeyan, Meka Nayana, “An
Efficient Arithmetic Coding Data Compression with Steganography”, IEEE
International Conference on Emerging Trends in Computing, Communication
and Nanotechnology, 2013.
 K. Ashok Babu and V. Satish Kumar, “Implementation of Data
Compression Using Huffman Coding”, Methods and Models in Computer
Science (ICM2CS), 2010 International Conference on , vol., no., pp.70,75, 1314 Dec. 2010.
 Monica Adriana Dagadit, Emil Ioan Slusanschi ,Razvan Dobre, “Data
Hiding Using Steganography”, IEEE 12th International Symposium on
Parallel and Distributed Computing, 2013.
 O. P Verma, Ritu Agarwal, Dhiraj Dafouti, Shobha Tyagi, “Peformance
Analysis Of Data Encryption Algorithms”, IEEE 2011.
 Jyoti Gaba, R.C. Mishra, “A Review Based Study of Hybrid Security Schemes
Based on Compression, Encryption and Steganography”,International Journal of
Engineering Trends and Technology (IJETT) – Volume 4 Issue 7- July 2013.
 Asjad Amin, Haseeb Ahmad Qureshi, Muhammad Junaid, “Run Length
Encoding Scheme with Introduction of Bit Stuffing for efficient Data
Compression”, International Conference for internet Technology and Secured
 Senthil Shanmugasundaram, Robert Lourdusamy, “A Comparative Study Of
Text Compression Algorithms”, International Journal of Wisdom Based
Computing, Vol. 1 (3), December 2011.
 G. Manikandan, N. Sairam and M. Kamarasan, “A Hybrid Approach for
Security Enhancement by Compressed Crypto-Stegno Scheme”, Research Journal
of Applied Sciences, Engineering and Technology 4(6): 608-614, 2012.