Joint Compression and Encryption of Virtual Machine Images Using LZMA and Chaotic Maps
Research Article  ·  Published: 31 July 2025
Issue cover
ICCK Transactions on Information Security and Cryptography
Volume 1, Issue 1, 2025: 3-12
Research Article Free to Read

Joint Compression and Encryption of Virtual Machine Images Using LZMA and Chaotic Maps

1 Department of Cyber Security, Pakistan Navy Engineering College, National University of Sciences and Technology, Karachi 75350, Pakistan
2 Cyber Security Center, Prince Mohammad Bin Fahd University, Al-Khobar, Saudi Arabia
* Corresponding Author: Muhammad Usama, [email protected]
Volume 1, Issue 1

Article Information

Abstract

The exponential growth in security and storage requirements has led to increasing demand for high-performance solutions, particularly in managing large-scale data objects such as big binaries. Virtual Machines (VMs), a prime example of such binaries, are widely employed across desktops and dynamic server environments to deliver isolated execution contexts while minimizing hardware overhead. However, the proliferation of big binaries imposes significant challenges on both storage infrastructure and secure data transmission mechanisms. To address these issues, this paper proposes a novel "Combined Big Binaries Compression and Encryption" (CBBCE) scheme that jointly performs compression and encryption in a unified framework. The proposed approach integrates Lempel–Ziv–Markov chain algorithm (LZMA) for efficient compression with a stream cipher-like encryption mechanism. A chaotic logistic map is employed as a key-controlled pseudorandom bitstream generator due to its high sensitivity to initial conditions, ergodicity, and long-period randomness. The compressed data stream is subsequently encrypted using this pseudorandom sequence to ensure confidentiality. Experimental evaluations demonstrate that the CBBCE approach achieves competitive compression ratios and enhanced security properties when compared to conventional sequential compression-then-encryption schemes. The proposed method is particularly well-suited for secure storage and transmission of large binary files, offering an effective trade-off between performance, security, and storage efficiency.

Keywords

chaos compression encryption secure compression compression and encryption big binaries virtual machines

Data Availability Statement

Data will be made available on request.

Funding

This work was supported without any funding.

Conflicts of Interest

The authors declare no conflicts of interest.

Ethical Approval and Consent to Participate

Not applicable.

References

  1. LZMA SDK (Software development kit). (n.d.). 7-Zip. Retrieved from http://www.7-zip.org/sdk.html
    [Google Scholar]
  2. Ziv, J., & Lempel, A. (1977). A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3), 337--343.
    [CrossRef] [Google Scholar]
  3. Zhang, Y., Xiao, D., Liu, H., & Nan, H. (2014). GLS coding based security solution to JPEG with the structure of aggregated compression and encryption. Communications in Nonlinear Science and Numerical Simulation, 19(5), 1366-1374.
    [CrossRef] [Google Scholar]
  4. Usama, M., Aziz, A., Alsuhibany, S. A., Hassan, I., & Yuldashev, F. (2025). IDCE: Integrated Data Compression and Encryption for Enhanced Security and Efficiency. CMES-Computer Modeling in Engineering and Sciences, 143(1), 1029-1048.
    [CrossRef] [Google Scholar]
  5. Wong, K. W., & Yuen, C. H. (2008). Embedding compression in chaos-based cryptography. IEEE Transactions on Circuits and Systems II: Express Briefs, 55(11), 1193-1197.
    [CrossRef] [Google Scholar]
  6. Wen, J., Kim, H., & Villasenor, J. D. (2006). Binary arithmetic coding with key-based interval splitting. IEEE Signal Processing Letters, 13(2), 69-72.
    [CrossRef] [Google Scholar]
  7. Wu, C. P., & Kuo, C. C. (2005). Design of integrated multimedia compression and encryption systems. IEEE Transactions on Multimedia, 7(5), 828-839.
    [CrossRef] [Google Scholar]
  8. Jakimoski, G., & Subbalakshmi, K. P. (2008). Cryptanalysis of some multimedia encryption schemes. IEEE transactions on multimedia, 10(3), 330-338.
    [CrossRef] [Google Scholar]
  9. Kim, H., Wen, J., & Villasenor, J. D. (2007). Secure arithmetic coding. IEEE Transactions on Signal processing, 55(5), 2263-2272.
    [CrossRef] [Google Scholar]
  10. Grangetto, M., Magli, E., & Olmo, G. (2006). Multimedia selective encryption by means of randomized arithmetic coding. IEEE Transactions on Multimedia, 8(5), 905-917.
    [CrossRef] [Google Scholar]
  11. Zhu, Z. L., Tang, Y., Liu, Q., Zhang, W., & Yu, H. (2012, October). A chaos-based joint compression and encryption scheme using mutated adaptive Huffman tree. In 2012 Fifth International Workshop on Chaos-fractals Theories and Applications (pp. 212-216). IEEE.
    [CrossRef] [Google Scholar]
  12. Zhou, J., Au, O. C., & Wong, P. H. W. (2009). Adaptive chosen-ciphertext attack on secure arithmetic coding. IEEE Transactions on Signal Processing, 57(5), 1825-1838.
    [CrossRef] [Google Scholar]
  13. Zhou, J., & Au, O. C. (2008). Comments on 'A Novel Compression and Encryption Scheme Using Variable Model Arithmetic Coding and Coupled Chaotic System'. IEEE Transactions on Circuits and Systems I: Regular Papers, 55(10), 3368--3369.
    [CrossRef] [Google Scholar]
  14. Xiang, T., Liao, X., Tang, G., Chen, Y., & Wong, K. W. (2006). A novel block cryptosystem based on iterating a chaotic map. Physics Letters A, 349(1-4), 109-115.
    [CrossRef] [Google Scholar]
  15. Huffman, D. A. (2007). A method for the construction of minimum-redundancy codes. Proceedings of the IRE, 40(9), 1098-1101.
    [CrossRef] [Google Scholar]
  16. Daemen, J., & Rijmen, V. (2002). The design of Rijndael: AES—the advanced encryption standard. Springer.
    [CrossRef] [Google Scholar]
  17. Lin, Y., Yang, Y., & Li, P. (2025). Development and future of compression-combined digital image encryption: A literature review. Digital Signal Processing, 158, 104908.
    [CrossRef] [Google Scholar]
  18. Kumar, S., & Sharma, D. (2024). A chaotic based image encryption scheme using elliptic curve cryptography and genetic algorithm. Artificial Intelligence Review, 57(4), 87.
    [CrossRef] [Google Scholar]
  19. Salahdine, F., Ghribi, E., & Kaabouch, N. (2020, January). Metrics for evaluating the efficiency of compressing sensing techniques. In 2020 International Conference on Information Networking (ICOIN) (pp. 562-567). IEEE.
    [CrossRef] [Google Scholar]
  20. Nagaraj, N., Vaidya, P. G., & Bhat, K. G. (2009). Arithmetic coding as a non-linear dynamical system. Communications in Nonlinear Science and Numerical Simulation, 14(4), 1013-1020.
    [CrossRef] [Google Scholar]
  21. Hermassi, H., Rhouma, R., & Belghith, S. (2010). Joint compression and encryption using chaotically mutated Huffman trees. Communications in Nonlinear Science and Numerical Simulation, 15(10), 2987-2999.
    [CrossRef] [Google Scholar]
  22. Baptista, M.S. (1998). Cryptography with chaos. Physics Letters A, 240(1), 50-54.
    [CrossRef] [Google Scholar]

Cite This Article

APA Style
Usama, M., & Ahmad, J. (2025). Joint Compression and Encryption of Virtual Machine Images Using LZMA and Chaotic Maps. ICCK Transactions on Information Security and Cryptography, 1(1), 3–12. https://doi.org/10.62762/TISC.2025.148753
Export Citation
RIS Format
Compatible with EndNote, Zotero, Mendeley, and other reference managers
TY  - JOUR
AU  - Usama, Muhammad
AU  - Ahmad, Jawad
PY  - 2025
DA  - 2025/07/31
TI  - Joint Compression and Encryption of Virtual Machine Images Using LZMA and Chaotic Maps
JO  - ICCK Transactions on Information Security and Cryptography
T2  - ICCK Transactions on Information Security and Cryptography
JF  - ICCK Transactions on Information Security and Cryptography
VL  - 1
IS  - 1
SP  - 3
EP  - 12
DO  - 10.62762/TISC.2025.148753
UR  - https://www.icck.org/article/abs/TISC.2025.148753
KW  - chaos
KW  - compression
KW  - encryption
KW  - secure compression
KW  - compression and encryption
KW  - big binaries
KW  - virtual machines
AB  - The exponential growth in security and storage requirements has led to increasing demand for high-performance solutions, particularly in managing large-scale data objects such as big binaries. Virtual Machines (VMs), a prime example of such binaries, are widely employed across desktops and dynamic server environments to deliver isolated execution contexts while minimizing hardware overhead. However, the proliferation of big binaries imposes significant challenges on both storage infrastructure and secure data transmission mechanisms. To address these issues, this paper proposes a novel "Combined Big Binaries Compression and Encryption" (CBBCE) scheme that jointly performs compression and encryption in a unified framework. The proposed approach integrates Lempel–Ziv–Markov chain algorithm (LZMA) for efficient compression with a stream cipher-like encryption mechanism. A chaotic logistic map is employed as a key-controlled pseudorandom bitstream generator due to its high sensitivity to initial conditions, ergodicity, and long-period randomness. The compressed data stream is subsequently encrypted using this pseudorandom sequence to ensure confidentiality. Experimental evaluations demonstrate that the CBBCE approach achieves competitive compression ratios and enhanced security properties when compared to conventional sequential compression-then-encryption schemes. The proposed method is particularly well-suited for secure storage and transmission of large binary files, offering an effective trade-off between performance, security, and storage efficiency.
SN  - 3070-2429
PB  - Institute of Central Computation and Knowledge
LA  - English
ER  - 
BibTeX Format
Compatible with LaTeX, BibTeX, and other reference managers
@article{Usama2025Joint,
  author = {Muhammad Usama and Jawad Ahmad},
  title = {Joint Compression and Encryption of Virtual Machine Images Using LZMA and Chaotic Maps},
  journal = {ICCK Transactions on Information Security and Cryptography},
  year = {2025},
  volume = {1},
  number = {1},
  pages = {3-12},
  doi = {10.62762/TISC.2025.148753},
  url = {https://www.icck.org/article/abs/TISC.2025.148753},
  abstract = {The exponential growth in security and storage requirements has led to increasing demand for high-performance solutions, particularly in managing large-scale data objects such as big binaries. Virtual Machines (VMs), a prime example of such binaries, are widely employed across desktops and dynamic server environments to deliver isolated execution contexts while minimizing hardware overhead. However, the proliferation of big binaries imposes significant challenges on both storage infrastructure and secure data transmission mechanisms. To address these issues, this paper proposes a novel "Combined Big Binaries Compression and Encryption" (CBBCE) scheme that jointly performs compression and encryption in a unified framework. The proposed approach integrates Lempel–Ziv–Markov chain algorithm (LZMA) for efficient compression with a stream cipher-like encryption mechanism. A chaotic logistic map is employed as a key-controlled pseudorandom bitstream generator due to its high sensitivity to initial conditions, ergodicity, and long-period randomness. The compressed data stream is subsequently encrypted using this pseudorandom sequence to ensure confidentiality. Experimental evaluations demonstrate that the CBBCE approach achieves competitive compression ratios and enhanced security properties when compared to conventional sequential compression-then-encryption schemes. The proposed method is particularly well-suited for secure storage and transmission of large binary files, offering an effective trade-off between performance, security, and storage efficiency.},
  keywords = {chaos, compression, encryption, secure compression, compression and encryption, big binaries, virtual machines},
  issn = {3070-2429},
  publisher = {Institute of Central Computation and Knowledge}
}

Article Metrics

Citations
Crossref
0
Scopus
0
Views
906
PDF Downloads
448

Publisher's Note

ICCK stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and Permissions

Institute of Central Computation and Knowledge (ICCK) or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
ICCK Transactions on Information Security and Cryptography
ICCK Transactions on Information Security and Cryptography
ISSN: 3070-2429 (Online)
Portico
Preserved at
Portico