Huffman tree based security system for mpeg vidoe applications

مقدم أطروحة جامعية

Rajab, Khalidah Shaban

الجامعة

الجامعة التكنولوجية

الكلية

-

القسم الأكاديمي

قسم هندسة السيطرة و النظم

دولة الجامعة

العراق

الدرجة العلمية

دكتوراه

تاريخ الدرجة العلمية

2008

الملخص الإنجليزي

in this thesis a special Huffman tree (SHT) algorithm is designed and implemented to encode an MPEG video file instead of the standard Huffman tree algorithm.

These (SHTs) are built one with gentries, and the other with 100-entries, The (SHT*) are encrypted using part of the key Stream generated by rabbit algorithm.

The other part of the keystrearn is used in insertion operation.

In this operation a number of bits of the keystream are inserted in the coded desired file.

The encrypted (SHTs) with the encoded desired file are sent to the receiver, so no one knows the tree used to encode the file except the sender and the receiver.

Implementing of the proposed algorithm is performed using Visual C++ language. Many types of tests and measurements {such as efficiency, compression, speed and security measurement) are achievied to evaluate the performance of this algorithm.

Calculation of the compression efficiency of (SHT) is found to be higher than that of the standard Huffman tree, Also, it is shown that the increasing ratio in size of the generated file to that of the original file is very small and can be neglected This mean that the compression performance of (SHT) is approximately the same as that of the standard Huffman tree. The overall computational speed of the proposed algorithm is calculated, which usually includes the computational key-setup speed and the computational encryption / decryption speed.

It is found that the memory required to store the information obtained from the key-setup operation in addition to its computational time is very small.

This allows executing the key-setup operation before encryption / decryption easily and lastly.

It is proved that the encryption / decryption speed is presented by the insertion operation which spends very small time so that it can be eliminated. The security of the proposed algorithm is evaluated visually and computationally.

The first approach is implemented using Ulead video studio ver.

8.0.

by capturing the same number of frames from all files.

The second approach is achieved by calculating the resistance of the algorithm analytically and proves that the resistance of the proposed algorithm against many known attacks such as brute-force, plaintext, ciphertext is very high resistance.

التخصصات الرئيسية

تكنولوجيا المعلومات وعلم الحاسوب

الموضوعات

• الكتابة
• التشفير
• المواصفات القياسية
• الرمزية
• الإجراءات الأمنية
• البيانات
• الفيديو الرقمي

• APA
• MLA
• AMA

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-305640