{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T12:23:43Z","timestamp":1766406223268,"version":"3.48.0"},"reference-count":31,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T00:00:00Z","timestamp":1766361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Faculty of Informatics, Mahasarakham University"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCP"],"abstract":"<jats:p>This study proposes the Huffman Tree and Binary Conversion (HTB) which is a preprocessing algorithm to transform the Huffman tree into binary representation before the encryption process. In fact, HTB can improve the structural readiness of plaintext by combining the Huffman code with a deterministic binary representation of the Huffman tree. In addition, binary representation of the Huffman tree and the compressed information will be encrypted by standard cryptographic algorithms. Six datasets, divided into two groups (short and long texts), were chosen to evaluate compression behavior and the processing cost. Moreover, AES and RSA are chosen to combine with the proposed method to analyze the encryption and decryption cycles. The experimental results show that HTB introduces a small linear-time overhead. That means, it is slightly slower than applying only the Huffman code. Across these datasets, HTB maintained a consistently low processing cost. The processing time is below one millisecond in both encoding and decoding processes. However, for long texts, the structural conversion cost becomes amortized across larger encoded messages, and the reduction in plaintext size leads to fewer encryption blocks for both AES and RSA. The reduced plaintext size lowers the number of AES encryption blocks by approximately 30\u201345% and decreases the number of encryption and decryption rounds in RSA. The encrypted binary representation of the Huffman tree also decreased structural ambiguity and reduced the potential exposure of frequency-related metadata. Although HTB does not replace cryptographic security, it enhances the structural consistency of compression. Therefore, the proposed method demonstrates scalability, predictable overhead, and improved suitability for cryptographic workflows.<\/jats:p>","DOI":"10.3390\/jcp6010001","type":"journal-article","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T11:43:31Z","timestamp":1766403811000},"page":"1","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Huffman Tree and Binary Conversion for Efficient and Secure Data Encryption and Decryption"],"prefix":"10.3390","volume":"6","author":[{"given":"Suchart","family":"Khummanee","sequence":"first","affiliation":[{"name":"Department of Computer Science, Faculty of Informatics, Mahasarakham University, Maha Sarakham 44000, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanapat","family":"Cheawchanwattana","sequence":"additional","affiliation":[{"name":"Department of Computer and Communication Engineering, Faculty of Technology and Engineering, Udon Thani Rajabhat University, UDRU, Udon Thani 41000, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7970-3088","authenticated-orcid":false,"given":"Chanwit","family":"Suwannapong","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Faculty of Engineering, Nakhon Phanom University, Nakhon Phanom 48000, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6853-6480","authenticated-orcid":false,"given":"Sarutte","family":"Atsawaraungsuk","sequence":"additional","affiliation":[{"name":"Department of Computer Education, Udon Thani Rajabhat University, Udon Thani 41000, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1311-8222","authenticated-orcid":false,"given":"Kritsanapong","family":"Somsuk","sequence":"additional","affiliation":[{"name":"Department of Computer and Communication Engineering, Faculty of Technology and Engineering, Udon Thani Rajabhat University, UDRU, Udon Thani 41000, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,12,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1109\/TIT.1983.1056754","article-title":"Relativized cryptography","volume":"29","author":"Brassard","year":"1983","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1002\/ima.20050","article-title":"Symmetric-key block cipher for image and text cryptography","volume":"15","author":"Amador","year":"2005","journal-title":"Int. J. Imaging Syst. Technol."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1147\/rd.402.0253","article-title":"A proposed mode for triple-DES encryption","volume":"40","author":"Coppersmith","year":"1996","journal-title":"IBM J. Res. Dev."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2288","DOI":"10.11591\/eei.v14i3.9320","article-title":"Linear algorithm for data retrieval performance optimization in self-encryption hybrid data centers","volume":"14","author":"Qatawneh","year":"2025","journal-title":"Bull. Electr. Eng. Inform."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/TC.2003.1190589","article-title":"A highly regular and scalable AES hardware architecture","volume":"52","author":"Mangard","year":"2023","journal-title":"IEEE Trans. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Kumar, M., Reddy, K.S., Rinaldi, S., Parameshachari, B.D., and Arunachalam, K. (2022). A low area high speed FPGA implementation of AES architecture for cryptography application. Electronics, 10.","DOI":"10.3390\/electronics10162023"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"ElGamal","year":"1985","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","article-title":"Elliptic Curve Cryptosystems","volume":"48","author":"Koblitz","year":"1987","journal-title":"Math. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","article-title":"Uses of elliptic curves in cryptography","volume":"218","author":"Miller","year":"1986","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"145045","DOI":"10.1109\/ACCESS.2021.3121252","article-title":"Novel Hybrid Public\/Private Key Cryptography Based on Perfect Gaussian Integer Sequences","volume":"9","author":"Hsia","year":"2021","journal-title":"IEEE Access"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"21566","DOI":"10.1038\/s41598-025-00334-6","article-title":"Conic curve encryption and digital signature based on complex number theory for cybersecurity applications","volume":"15","author":"Kamal","year":"2025","journal-title":"Sci. Rep."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"5191","DOI":"10.1007\/s11042-021-11741-y","article-title":"A new high capacity and secure image realization steganography based on ASCII code matching","volume":"81","author":"Elshoush","year":"2020","journal-title":"Multimed. Tools Appl."},{"key":"ref_15","first-page":"85","article-title":"Huffman coding","volume":"52","author":"Moffat","year":"2019","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Islam, M., Nurain, N., Kaykobad, M., Chellappan, S., and Alim Al Islam, A.B.M. (2019, January 12\u201314). HEliOS: Huffman Coding Based Lightweight Encryption Scheme for Data Transmission. Proceedings of the 16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, Houston, TX, USA.","DOI":"10.1145\/3360774.3360829"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Karakra, A., and Alsadeh, A. (2016, January 13\u201315). A-RSA: Augmented RSA. Proceedings of the SAI Computing Conference 2016, London, UK.","DOI":"10.1109\/SAI.2016.7556103"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1109\/5.4442","article-title":"The first ten years of public-key cryptography","volume":"76","author":"Diffie","year":"1988","journal-title":"Proc. IEEE"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MCOM.1978.1089772","article-title":"An overview of public key cryptography","volume":"16","author":"Hellman","year":"1978","journal-title":"IEEE Commun. Mag."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.eij.2022.02.001","article-title":"An improved random bit-stuffing technique with a modified RSA algorithm for resisting attacks in information security (RBMRSA)","volume":"23","author":"Mojisola","year":"2022","journal-title":"Egypt. Inform. J."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1080\/24699322.2019.1649070","article-title":"Development of modified RSA algorithm using fixed mersenne prime numbers for medical ultrasound imaging instrumentation","volume":"24","author":"Shin","year":"2019","journal-title":"Comput. Assist. Surg."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"2375","DOI":"10.18517\/ijaseit.11.6.13700","article-title":"Eight prime numbers of modified rsa algorithm method for more secure single board computer implementation","volume":"11","author":"Hermawan","year":"2021","journal-title":"Int. J. Adv. Sci. Eng. Inf. Technol."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"19769","DOI":"10.1007\/s11042-021-10700-x","article-title":"Image encryption method based on improved ECC and modified AES algorithm","volume":"80","author":"Hafsa","year":"2021","journal-title":"Multimed. Tools Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2948","DOI":"10.12928\/telkomnika.v18i6.17278","article-title":"Authentication system for e-certificate by using RSA\u2019s digital signature","volume":"18","author":"Somsuk","year":"2020","journal-title":"TELKOMNIKA Telecommun. Comput. Electron. Control"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2432513","DOI":"10.1080\/23311916.2024.2432513","article-title":"The development of signing and verification methods for high speed digital signatures on electronic official documents by using RSA cryptography","volume":"11","author":"Somsuk","year":"2024","journal-title":"Cogent Eng."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Krokosz, T., Rykowski, J., Zaj\u0119cka, M., Brzoza-Woch, R., and Rutkowski, L. (2023). Cryptographic Algorithms with Data Shorter than the Encryption Key, Based on LZW and Huffman Coding. Sensors, 23.","DOI":"10.3390\/s23177408"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"140559","DOI":"10.1109\/ACCESS.2023.3341512","article-title":"How Does a Transformer Learn Compression? An Attention Study on Huffman and LZ4","volume":"11","author":"Seo","year":"2023","journal-title":"IEEE Access"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Sutomo, V.D., Cenon, N., Kang, A., Bandjar, I.D.A.K.A.P., Kurniadi, F.I. (2023, January 7\u20138). Does Deflate Outperform Huffman Lossless Compression?. Proceedings of the 9th International Conference on Computing, Engineering and Design, Kuala Lumpur, Malaysia.","DOI":"10.1109\/ICCED60214.2023.10425138"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0217017","article-title":"A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks","volume":"17","author":"Goldwasser","year":"1988","journal-title":"SIAM J. Comput."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1364\/OL.31.001044","article-title":"Known-plaintext attack on optical encryption based on double random phase keys","volume":"31","author":"Peng","year":"2006","journal-title":"Opt. Lett."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1007\/s00145-016-9238-4","article-title":"Instantiability of RSA-OAEP under chosen-plaintext attack","volume":"30","author":"Kiltz","year":"2017","journal-title":"J. Cryptol."}],"container-title":["Journal of Cybersecurity and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2624-800X\/6\/1\/1\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T12:20:12Z","timestamp":1766406012000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2624-800X\/6\/1\/1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,22]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["jcp6010001"],"URL":"https:\/\/doi.org\/10.3390\/jcp6010001","relation":{},"ISSN":["2624-800X"],"issn-type":[{"value":"2624-800X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,22]]}}}