{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T16:17:52Z","timestamp":1772727472970,"version":"3.50.1"},"reference-count":24,"publisher":"MDPI AG","issue":"17","license":[{"start":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T00:00:00Z","timestamp":1692921600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Polish Ministry of Education and Science"},{"name":"project ARTIQ"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Modern, commonly used cryptosystems based on encryption keys require that the length of the stream of encrypted data is approximately the length of the key or longer. In practice, this approach unnecessarily complicates strong encryption of very short messages commonly used for example in ultra-low-power and resource-constrained wireless network sensor nodes based on microcontrollers (MCUs). In such cases, the data payload can be as short as a few bits of data while the typical length of the key is several hundred bits or more. The article proposes an idea of employing a complex of two algorithms, initially applied for data compression, acting as a standard-length encryption key algorithm to increase the transmission security of very short data sequences, even as short as one or a few bytes. In this article, we present and evaluate an approach that uses LZW and Huffman coding to achieve data transmission obfuscation and a basic level of security.<\/jats:p>","DOI":"10.3390\/s23177408","type":"journal-article","created":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T08:42:20Z","timestamp":1692952940000},"page":"7408","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Cryptographic Algorithms with Data Shorter than the Encryption Key, Based on LZW and Huffman Coding"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1518-5848","authenticated-orcid":false,"given":"Tomasz","family":"Krokosz","sequence":"first","affiliation":[{"name":"Department of Information Technology, Pozna\u0144 University of Economics and Business, 61-875 Poznan, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7944-6061","authenticated-orcid":false,"given":"Jarogniew","family":"Rykowski","sequence":"additional","affiliation":[{"name":"Department of Information Technology, Pozna\u0144 University of Economics and Business, 61-875 Poznan, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ma\u0142gorzata","family":"Zaj\u0119cka","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computer Science, Electronics and Telecommunications, AGH University of Krakow, 30-059 Krakow, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8340-5454","authenticated-orcid":false,"given":"Robert","family":"Brzoza-Woch","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computer Science, Electronics and Telecommunications, AGH University of Krakow, 30-059 Krakow, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6960-9525","authenticated-orcid":false,"given":"Leszek","family":"Rutkowski","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computer Science, Electronics and Telecommunications, AGH University of Krakow, 30-059 Krakow, Poland"},{"name":"Systems Research Institute of the Polish Academy of Sciences, 01-447 Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,8,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"103720","DOI":"10.1016\/j.csi.2023.103720","article-title":"Privacy preserving Federated Learning framework for IoMT based big data analysis using edge computing","volume":"7","author":"Nair","year":"2023","journal-title":"Comput. Stand. Interfaces"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1049\/htl2.12008","article-title":"Ensuring data integrity of healthcare information in the era of digital health","volume":"8","author":"Zarour","year":"2021","journal-title":"Healthc. Technol. Lett."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1038\/s41597-023-01997-4","article-title":"City-scale synthetic individual-level vehicle trip data","volume":"10","author":"Li","year":"2023","journal-title":"Sci. Data"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Lin, H.Y. (2023). Secure Data Transfer Based on a Multi-Level Blockchain for Internet of Vehicles. Sensors, 23.","DOI":"10.3390\/s23052664"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"100721","DOI":"10.1016\/j.iot.2023.100721","article-title":"The Internet of Things (IoT) in healthcare: Taking stock and moving forward","volume":"10","author":"Rejeb","year":"2023","journal-title":"Internet Things"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"109453","DOI":"10.1016\/j.patcog.2023.109453","article-title":"A survey of human\u2013computer interaction (HCI) & natural habits-based behavioural biometric modalities for user recognition schemes","volume":"25","author":"Gupta","year":"2023","journal-title":"Pattern Recognit."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"117660","DOI":"10.1016\/j.eswa.2022.117660","article-title":"Mechanism design for data reliability improvement through network-based reasoning model","volume":"205","author":"Kyeong","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.jnca.2018.07.007","article-title":"A survey study on internet of things resource management","volume":"120","author":"Chowdhury","year":"2018","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"van Tilborg, H.C.A., and Jajodia, S. (2011). Encyclopedia of Cryptography and Security, Springer.","DOI":"10.1007\/978-1-4419-5906-5"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.procs.2016.02.108","article-title":"A comprehensive evaluation of cryptographic algorithms: DES, 3DES, AES, RSA and Blowfish","volume":"78","author":"Patil","year":"2016","journal-title":"Procedia Comput. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1016\/j.procs.2016.03.131","article-title":"AES based text encryption using 12 rounds with dynamic key selection","volume":"79","author":"Mathur","year":"2016","journal-title":"Procedia Comput. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1016\/j.proeng.2011.08.248","article-title":"Analysis of RSA based on quantitating key security strength","volume":"15","author":"Tan","year":"2011","journal-title":"Procedia Eng."},{"key":"ref_13","first-page":"580","article-title":"Generic Related-Key Attacks for HMAC","volume":"Volume 7658","author":"Peyrin","year":"2012","journal-title":"Proceedings of the ASIACRYPT"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.sysarc.2006.09.006","article-title":"Multi-mode operator for SHA-2 hash functions","volume":"53","author":"Glabb","year":"2007","journal-title":"J. Syst. Archit."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/JPROC.2005.862300","article-title":"An introduction to block cipher cryptanalysis","volume":"94","author":"Biryukov","year":"2006","journal-title":"Proc. IEEE"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Rong, C., Zhao, G., Yan, L., Cayirci, E., and Cheng, H. (2013). Computer and Information Security Handbook, Elsevier.","DOI":"10.1016\/B978-0-12-394397-2.00018-0"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"e46","DOI":"10.1002\/spy2.46","article-title":"A comparative study and analysis of some pseudorandom number generator algorithms","volume":"1","author":"Sinha","year":"2018","journal-title":"Secur. Priv."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Pu, I.M. (2005). Fundamental Data Compression, Butterworth-Heinemann.","DOI":"10.1016\/B978-075066310-6\/50013-1"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1109\/TIT.1986.1057239","article-title":"Bounds on the redundancy of Huffman codes (Corresp.)","volume":"32","author":"Capocelli","year":"1986","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","article-title":"A Technique for High-Performance Data Compression","volume":"17","author":"Welch","year":"1984","journal-title":"Computer"},{"key":"ref_21","first-page":"22","article-title":"LZW data compression","volume":"3","author":"Dheemanth","year":"2014","journal-title":"Am. J. Eng. Res."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Bidgoli, H. (2003). Encyclopedia of Information Systems, Elsevier.","DOI":"10.1016\/B0-12-227240-4\/00126-X"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proc. IRE"},{"key":"ref_24","unstructured":"Van Leeuwen, J. (1976, January 20\u201323). On the Construction of Huffman Trees. Proceedings of the ICALP, University of Edinburgh, Edinburgh, UK."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/17\/7408\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:38:50Z","timestamp":1760128730000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/17\/7408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,25]]},"references-count":24,"journal-issue":{"issue":"17","published-online":{"date-parts":[[2023,9]]}},"alternative-id":["s23177408"],"URL":"https:\/\/doi.org\/10.3390\/s23177408","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,25]]}}}