Cryptographic Algorithms with Data Shorter than the Encryption Key, Based on LZW and Huffman Coding
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-...
Main Authors: | Tomasz Krokosz, Jarogniew Rykowski, Małgorzata Zajęcka, Robert Brzoza-Woch, Leszek Rutkowski |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-08-01
|
Series: | Sensors |
Subjects: | |
Online Access: | https://www.mdpi.com/1424-8220/23/17/7408 |
Similar Items
-
Pemampatan Citra Keabuan dengan Algoritma Adaptive Huffman dan LZW
by: Djuned Fernando Djusdek, et al.
Published: (2017-01-01) -
Burrows–Wheeler Transform Based Lossless Text Compression Using Keys and Huffman Coding
by: Md. Atiqur Rahman, et al.
Published: (2020-10-01) -
Reversible Data Hiding in Encrypted Images Based on Hybrid Prediction and Huffman Coding
by: Liansheng Sui, et al.
Published: (2023-06-01) -
A New Chaotic Image Steganography Technique Based on Huffman Compression of Turkish Texts and Fractal Encryption With Post-Quantum Security
by: Mustafa Cem Kasapbasi
Published: (2019-01-01) -
High-capacity separable reversible data-Hiding method in encrypted images based on block-level encryption and Huffman compression coding
by: Kai-Meng Chen, et al.
Published: (2021-10-01)