Efficient Data Compression Scheme for Secured Application Needs

  • Ravi Kashyap
  • Twinkle Verma
  • Priyanka Kwatra
  • Sidhartha Sankar RoutEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 892)


The widespread availability of 3G/4G network could make Intelligent Traffic Systems (ITS) capable of wirelessly connecting to the data networks. The near future possibility of 5G communication would make this service more promising. The applications like traffic management and military where ITS plays an important role, demands a huge amount of secure data transmission. Massive data transfer is always a costly affair in terms of power, performance and reliability. A suitable data compression technique equipped with robust encryption methodology can leverage the burden of extensive data transportation. The shrunken data transmitted can be decrypted and decompressed at the receiver end, and there by the original information can be recovered. This paper demonstrates an efficient way of lossless data compression using a blend of Static and Instantaneous encoding named as SIN Compression. The proposed scheme encodes the data based upon a suitable threshold point that eliminates the large number of iterations used in traditional compression methods. For an experiment performed over a 16 × 16 pixel image; the SIN compression shows 60% of performance, 64% of area, and 69% of power improvement over the original lossless Huffman compression.


Compression Encryption Secured applications 


  1. 1.
    Khashman, A.: Automatic detection of military targets utilising neural networks and scale space analysis. In: RTO IST Symposium on New Information Processing Techniques for Military Systems (2000)Google Scholar
  2. 2.
    Zhao, Y.-Q., Gui, W.-H., Chen, Z.-C., Tang, J.-T., Li, L.-Y.: Medical images edge detection based on mathematical morphology. In: 27th Annual International Conference of the Engineering in Medicine and Biology Society, pp. 6492–6495. IEEE (2005)Google Scholar
  3. 3.
    Huffman, D.: A method for the construction of minimum redundancy codes. Proc. IRE 40, 1098–1101 (1952)CrossRefGoogle Scholar
  4. 4.
    Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Commun. ACM 30(6), 520–540 (1987)CrossRefGoogle Scholar
  5. 5.
    Welch, T.A.: A technique for high-performance data compression. Computer 17(6), 8–19 (1984)CrossRefGoogle Scholar
  6. 6.
    Heghbati, H.K.: An overview of data compaction techniques. Computer 14(4), 71–75 (1981)CrossRefGoogle Scholar
  7. 7.
    Carreto-Castro, M.F., Ramirez, J.M., Ballesteros, J.L., Baez-Lopez, D.: Comparison of lossless compression techniques. In: IEEE Proceedings of the 36th Midwest Symposium on Circuits and System, vo1. 2, pp. 1268–1270 (1993)Google Scholar
  8. 8.
    Daemen, J., Rijmen, V.: AES proposal: Rijndael. In: Banksys/Katholieke Universiteit Leuven, Belgium, AES submission (1998)Google Scholar
  9. 9.
    National Bureau of Standards - Data Encryption Standard, FIPS Publication 46 (1977)Google Scholar
  10. 10.
    Schneier, B.: Description of a new variable-length key, 64-bit block cipher (Blowfish). In: Anderson, R. (ed.) FSE 1993. LNCS, vol. 809, pp. 191–204. Springer, Heidelberg (1993). Scholar
  11. 11.
    Pi, C.W., Yuan-Rung, Y., Chun-Liang, L., Hung-Yi, C.: A memory efficient Huffman decoding algorithm. In: 19th International Conference on Advanced Information and Applications, Taipei, Taiwan, vol. 2, pp. 475–479 (2005)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Jaypee Institute of Information TechnologyNoidaIndia
  2. 2.Indraprastha Institute of Information Technology DelhiNew DelhiIndia

Personalised recommendations