RSA-OAEP and Huffman Hybrid: Secure and Efficient Approach to Network Data Encryption and Compression
Abstract
The limits of standalone encryption or compression techniques in networked systems have been brought to light by the exponential expansion of digital data and the growing demand for secure transmission mechanisms. In order to overcome these difficulties, this work suggests a hybrid architecture that combines RSA-OAEP encryption and Huffman compression to improve data transmission efficiency and security. Data was compressed using Huffman coding to minimize redundancy and reduce space, and then encrypted using an efficient RSA-OAEP technique to guarantee secrecy and integrity. Thorough tests that measured encryption/decryption time, compression ratio, throughput, and system resource utilization under various file sizes and situations were used to assess performance. Although the hybrid technique had a larger computational cost than standalone RSA or RSA-OAEP, the results showed that it produced compression ratios between 1.5 and 2.1, greatly lowering file sizes and improving bandwidth efficiency. While decryption throughput remained lower due to computational complexity, and resource utilization grew proportionately with file size, encryption throughput surpassed 1300 kb/s for bigger files. In spite of greater processing times for compression and decryption, the hybrid model offered robustness against cryptographic assaults and stronger security-compression integration, in line with NIST standards. In summary, the RSA-OAEP+Huffman hybrid model is appropriate for resource-constrained contexts such as cloud, IoT, and mobile networks because it successfully strikes a balance between security and transmission efficiency. Future research should concentrate on investigating dynamic Huffman encoding, expanding the approach to real-time multimedia applications, and improving computational performance for bigger datasets.
Keywords:
RSA-OEAP and Huffman, Network Data Transmission, Encryption, Compression, Performance Analysis, Post-Quantum Cryptography, Hybrid Cryptography, Resource-Constrained SystemsDownloads
Downloads
ACCESSES
Published
Issue
Section
License
Copyright (c) 2025 Ezra, B., Manga, I., Sarjiyus, O. (Author)

This work is licensed under a Creative Commons Attribution 4.0 International License.










