@Article{cmes.2025.061787,
AUTHOR = {Muhammad Usama, Arshad Aziz, Suliman A. Alsuhibany, Imtiaz Hassan, Farrukh Yuldashev},
TITLE = {IDCE: Integrated Data Compression and Encryption for Enhanced Security and Efficiency},
JOURNAL = {Computer Modeling in Engineering \& Sciences},
VOLUME = {143},
YEAR = {2025},
NUMBER = {1},
PAGES = {1029--1048},
URL = {http://www.techscience.com/CMES/v143n1/60459},
ISSN = {1526-1506},
ABSTRACT = {Data compression plays a vital role in data management and information theory by reducing redundancy. However, it lacks built-in security features such as secret keys or password-based access control, leaving sensitive data vulnerable to unauthorized access and misuse. With the exponential growth of digital data, robust security measures are essential. Data encryption, a widely used approach, ensures data confidentiality by making it unreadable and unalterable through secret key control. Despite their individual benefits, both require significant computational resources. Additionally, performing them separately for the same data increases complexity and processing time. Recognizing the need for integrated approaches that balance compression ratios and security levels, this research proposes an integrated data compression and encryption algorithm, named <i>IDCE</i>, for enhanced security and efficiency. The algorithm operates on 128-bit block sizes and a 256-bit secret key length. It combines Huffman coding for compression and a Tent map for encryption. Additionally, an iterative Arnold cat map further enhances cryptographic confusion properties. Experimental analysis validates the effectiveness of the proposed algorithm, showcasing competitive performance in terms of compression ratio, security, and overall efficiency when compared to prior algorithms in the field.},
DOI = {10.32604/cmes.2025.061787}
}