کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
528955 869619 2011 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the security of multiple Huffman table based encryption
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
On the security of multiple Huffman table based encryption
چکیده انگلیسی

Recently, an encryption algorithm using multiple Huffman tables was proposed to protect multimedia content. Since the encryption operation can be efficiently implemented, its speed is several times faster than AES (Advanced Encryption Standard) or any known stream ciphers. In this paper, the security of this algorithm will be analyzed in detail. It is shown that the key is recovered with one ciphertext and the corresponding plaintext consisting of about 10 blocks of symbols by known-plaintext attack or with thousands of ciphertexts by ciphertext-only attack.

Research highlights
► Present three observations about the weaknesses of the original algorithm.
► Present a known-plaintext attack based on these observations.
► Present a ciphertext-only attack based on another observation.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Visual Communication and Image Representation - Volume 22, Issue 1, January 2011, Pages 85–92
نویسندگان
, , , ,