Show: 25 50 75 100 Results

Search results: 25 out of 3,669

دراسة لغوية اجتماعية للغة الدردشة كوسيلة تواصل باستعمال الكومبيوتر == A Sociolinguistic Study Of Language Of Chatting As Computer Mediated Communication

Author name: دعاء قاسم نعيم الزبيدي
Supervisor name: قاسم عبيس العزاوي
General topic: Foreign Languages
Specific topic: English - Language
Degree: Master
Language: English
University location: Babylon
First pages:

في النصوص الدينية الانجليزية والعربية : دراسة تداولية تقابلية == Imprecatives In English And Arabic Religious Texts : A Contrastive Pragmatic Study

Author name: سعاد محمد ماشي المنصوري
Supervisor name: حميد حسون بجية المسعودي
General topic: Foreign Languages
Specific topic: English - Language
Degree: Master
Language: English
University location: Babylon
First pages:

العهد في النصوص الدينية الانجليزية والعربية : دراســة تقابلية == Pledge In English And Arabic Religious Texts : A Contrastive Study

Author name: فلاح ناهي ريكان
Supervisor name: قاسم عباس ضايف الطفيلي
General topic: Foreign Languages
Specific topic: English - Language
Degree: Master
Language: English
University location: Babylon
First pages:

دراسة تداولية للمناورة الاستراتيجية في مقابلات سياسية مختارة == A Pragmatic Study Of Strategic Maneuvering In Selected Political Interviews

Author name: وليد رضى حمودي
Supervisor name: عباس ديكان درويش
General topic: Foreign Languages
Specific topic: English - Language
Degree: Master
Language: English
University location: Babylon
First pages:

التحية في النصوص الدينية الانجليزية والعربية : دراسة مقارنة == Greeting In English And Arabic Religious Texts : A Contrastive Study

Author name: صادق مهدي كاظم الشمري
Supervisor name: عباس ديكان درويش
General topic: Foreign Languages
Specific topic: English - Language
Degree: Master
Language: English
University location: Babylon
First pages:

استعمال فعل الكلام "المنع" لدى الطلبة العراقيين متعلمي اللغة الانكليزية لغة اجنبية == Iraqi EFL Learners' Use Of The Speech Act Of Prohibition

Author name: شيماء عبد عبد الامير الخفاجي
Supervisor name: رزاق نايف مخيف الشافعي
General topic: Foreign Languages
Specific topic: English - Language
Degree: Master
Language: English
University location: Babylon
First pages:

الاليات التداولية للاغتياب في بعض من روايات جين اوستن == The Pragmatics Of Gossip In Some Of Jane Austen’S Novels

Author name: حسن هادي مهدي ابو كروز
Supervisor name: فريد حميد حمزة الهنداوي
General topic: Foreign Languages
Specific topic: English - Language
Degree: Master
Language: English
University location: Babylon
First pages:

دراسة تداولية للتهكم في خطب الانتخابات السياسية == A Pragmatic Study Of Irony In Electoral Political Speeches

Author name: باسم جبير كاظم
Supervisor name: فريد حميد حمزة الهنداوي
General topic: Foreign Languages
Specific topic: English - Language
Degree: Master
Language: English
University location: Babylon
First pages:

تحليل صنفي تقابلي للافتتاحيات الصحفية في الانكليزية والعربية == A Contrastive Genre Analysis Of Newspaper Editorials In English And Arabic

Author name: امجد كاظم عبيد الركابي
Supervisor name: مجيد عبد الحليم الماشطة
General topic: Foreign Languages
Specific topic: English - Language
Degree: Master
Language: English
University location: Babylon
First pages:

تحليل لغوي للافتراضات المسبقة في تحقيقات الشرطة == A Linguistic Analysis Of Presuppositions In Police Interrogations

Author name: محمد كاظم علي السهلاني
Supervisor name: حميد حسون بجية المسعودي
General topic: Foreign Languages
Specific topic: English - Language
Degree: Doctorate
Language: English
University location: Babylon
First pages:

التناور الاستراتيجي في المحاكمات الامريكية المدنية والجنائية == Strategic Maneuvering In American Civil And Criminal Court Trials

Author name: رامية فؤاد عبد العزيز مرزة
Supervisor name: فريد حميد حمزة الهنداوي
General topic: Foreign Languages
Specific topic: English - Language
Degree: Doctorate
Language: English
University location: Babylon
First pages:

دراسة تداولية للدعاية السياسية == A Pragmatic Study Of Political Propaganda

Author name: زينة عبد الحسين خضير الشمري
Supervisor name: رياض طارق كاظم العميدي | كامل حسون القيم
General topic: Foreign Languages
Specific topic: English - Language
Degree: Master
Language: English
University location: Babylon
First pages:

بناء بيئة حسابية متوازية باستخدام واجهة عبور الرسالة == Implementation of a Parallel Computing Environment Using Message Passing Interface

Author name: دنيا حامد حميد
Supervisor name: لمياء حافظ خالد | سوسن كمال ثامر
General topic: Computer Science
Specific topic: Computer Science
Degree: Master
Language: English
University location: Babylon
First pages:
Abstract: Message Passing Interface (MPI) provides an infrastructure that enables users to build a high performance distributed computing environment from networked computers with minimum effort. It provides a common Application Programming Interface (API) for the development of parallel applications regardless of the type of multiprocessor system used. This research implements a distributed computing system called Java Message Passing Interface Middleware which supports a Message Passing Interface Application Programming Interface (MPI API). It installs Java Message Passing Interface (JMPI) package and runs three applications (Range Addition, Matrix - Vector Multiplication and Gauss Elimination method) in two modes serial and parallel.The system implemented on a Local Area Network (LAN) consisted of five computers. Many experiments have been performed to test the system and it found that results of parallel applications were close to the results of serial applications because the calculation times of applications were simple compared to communication times.

تصميم وتنفيذ تطبيق دردشة قائم على نظام اندرويد امن من نهاية الى نهاية == Design and Implementation of an End - to - End Secure Android based Chat Application

Author name: نور صباح حمزة محمد
Supervisor name: جمال محمد كاظم | بان نديم ذنون
General topic: Computer Science
Specific topic: Computer Science
Degree: Master
Language: English
University location: Babylon
First pages:
Abstract: Chat applications have become one of the most important and popular applications on smartphones. It has the capability of exchange text messages, images and files which it cost free for the users to communicate with each other. All messages must be protected but most of these applications have security and privacy issues.The aim of this thesis is to propose chat application that provides End - to - End security that let safely exchange private information with each other without worrying about data. In addition, the storage is encrypted.The design of the proposed chat application (Secure Chat Application) is based on client - server architecture. A list of requirements is taken in consideration to design and implement.It allows to send a friendship request to a friend before starting the conversation and then can exchange messages safely and store messages in encrypted place, thus the security and privacy were maintained.The XSalsa20 algorithm has been used to encrypt the password and messages, Poly1305 algorithm to verify the authenticity of a message, Curve25519 algorithm to generate a key pair to produce the shared key that is used to encrypt the session between the sender and the receiver, and Advanced Encryption Standard (AES) for encrypting local storage.The application has been tested and evaluated according to two important factors in these applications : time consuming and security. In term of time consuming, the longest time it takes for encrypting a message is less than 0.0082 seconds, while for decrypting, it takes less than 0.015 seconds. As for security, the application was tested by printing the results, and Wireshark software was used to test the channel encryption between the application and Firebase Cloud Messaging (FCM).

طرائق تجميع البيانات الكفوءة باستخدام الطاقة من اجل اطالة عمر شبكات الاستشعار اللاسلكية الدورية == ENERGY - EFFICIENT DATA AGGREGATION APPROACHES FOR PROLONGING LIFETIME OF PERIODIC WIRELESS SENSOR NETWORKS

Author name: علي كاظم محمد هداب الغرابي
Supervisor name: علي كاظم ادريس السعدي
General topic: Computer Science
Specific topic: Information Technology
Degree: Doctorate
Language: English
University location: Babylon
First pages:
Abstract: تمثل شبكات الاستشعار (اللاسلكية) الدورية (PSNs) واحدة من العناصر الاساسية في مستقبل انترنت الاشياء (IoT) وانها تلعب دورا هاما في حياة الناس بسبب استخدامها على نطاق واسع في العديد من التطبيقات. خصائص هذه الشبكات تمييزها عن الشبكات اللاسلكية المخصصة الاخرى. علاوة على ذلك، تفرض عدة قيود بسبب هذه الخصائص والتي تؤدي الى العديد من التحديات في شبكات الاستشعار الدورية. احد التحديات البحثية الاساسية في شبكات (PSNs) هو جمع ودمج كمية كبيرة من البيانات بطريقة موفرة للطاقة ومن ثم نقلها الى القاعدة (المحطة الاساسية) من اجل تمديد واطالة عمر الشبكة. وبما ان بطاريات المستشعرات لها عمر محدود، لذلك فان طريقة جمع البيانات ودمجها بشكل موفر للطاقة يعتبر امر ضروري لتحسين استهلاك الطاقة.في هذه الاطروحة، تم التركيز بشكل كبير على مشكلة تجميع البيانات، حيث توفير الطاقة يعتبر شرط اساسي. لقد تم اقتراح طرق تجميع البيانات الموفرة للطاقة والتي تهدف بشكل نهائي لتمديد واطالة عمر شبكة (PSN). لمعالجة هذه المشكلة، تقترح هذه الاطروحة طرق تجميع البيانات والتي تعمل على مستوى واحد ومستويين للتقليل من تكرار البيانات وتقليل الطاقة المستهلكة مع الحفاظ على مستوى مناسب من دقة البيانات بالنسبة للبيانات المستلمة في القاعدة (المحطة الاساسية). تم اقتراح خمسة طرق جديدة تعمل بصورة موزعة لتجميع البيانات بطريقة موفرة للطاقة تقوم على اساس البنية العنقودية. ويمكن توزيع هذه الطرق على عقد الاستشعار في المنطقة التي يرغب بمراقبتها. وبصورة ادق، فان الهدف من هذه الطرق هو تجميع البيانات المستشعرة على مستويين : احدهما على مستوى عقد اجهزة الاستشعار والاخر على مستوى المجمع (راس المجموعة (CH)) لاطالة عمر الشبكة في شبكات (PSNs).في المستوى الاول (مستوى عقد جهاز الاستشعار)، تم تطوير ثلاثة طرق مختلفة كفوءة باستخدام الطاقة وهي (DADAC, EADiDaC and DiDaSeF) والتي تهدف الى ازالة قراءات اجهزة الاستشعار الزائدة، توفير الطاقة، وتمديد واطالة عمر الشبكة. في الطريقة الرابع، تم اقتراح تجميع البيانات على مستويين (TLDA) لاطالة عمر شبكات الاستشعار الدورية. دمج البيانات يتم انجازه باستخدام تقنية التقريب المستمر للتكيف (APCA) لتقليل كمية البيانات التي يجمعها كل جهاز استشعار. يتم تطبيق المستوى الثاني في المجمع (راس المجموعة (CH)). ويشمل تجميع مجموعات البيانات المستلمة استنادا الى جدول تجزئة التسلسل باستخدام طريقة تكميم (SAX)، بالاضافة الى طرق معالجة اخرى. في الطريقة الخامسة، قمنا بتصميم وتنفيذ نظام كامل لتجميع البيانات (DAF) لزيادة عمر شبكات (PSNs). تعمل دالة التجميع في راس المجموعة (CH) كمرشح من خلال تمكين راس المجموعة من تحديد، ثم ازالة، مجاميع البيانات الزائدة عن الحاجة والتي تنتجها العقد المتجاورة، لتقليل المجموعات النهائية التي ستستقبلها القاعدة )المحطة الاساسية(.قمنا باجراء تجارب محاكاة واسعة النطاق على بيانات الاستشعار الحقيقية من خلال تطبيق برنامج (OMNeT++) لمحاكاة الشبكة لشرح فعالية البروتوكولات المقترحة بالمقارنة مع الطرق الاخرى المقترحة في الادبيات. تظهر نتائج التجارب بان طريقة (DADAC) قللت القراءات المجموعة من 18% الى 76% ومن 5% الى 29% مقارنة مع (PFF and Harb) بالتتابع. الطاقة المستهلكة بالنسبة لعقد الاستشعار باستخدام طريقة (EADiDaC) تم تقليلها من 27% الى 57% ومن 15% الى 43% مقارنة مع (PFF and Harb) بالتتابع. طريقة DiDASeF قللت البيانات المتبقية الى 10% كاقصى حد بعد تطبيق خطوة دمج البيانات في كل دورة، بينما المعدل هو 31% في ATP و100% في PFF. طريقة TLDA قللت الطاقة المصروفة في راس المجموعة لغاية 72% و61% مقارنة مع (PFF and Harb) بالتتابع. مرحلة دمج البيانات في طريقة DAF قللت البيانات المتبقة لغاية 9.322% في كل دورة، بينما المعدل هو 18.34% في طريقة TLDA. | Periodic Sensor Networks (PSNs) represent one of the essential elements in the future of Internet of Things (IoT) and it plays an important role in people’s life because of their widespread use in many applications. The characteristics of these PSNs differentiate it from other ad - hoc wireless networks. Furthermore, several limitations due to these characteristics are imposed and led to many challenges in the PSNs. One fundamental research challenge in PSNs is to periodically collect and aggregate the large volume of data in an energy efficient way and then transmit them to the sink so as to enhance the network lifetime. Since sensor batteries have a limited lifetime, therefore, energy - efficient data collection and aggregation method to periodic data collection is required for energy optimization.In this dissertation, highly focusing on the data aggregation problem, where energy - saving is also the essential condition. Energy - efficient data aggregation approaches had been proposed with the final goal of prolonging the PSN lifetime. To address this problem, this dissertation suggests one level and two levels data aggregation approaches for reducing the data redundancy and minimize the consumed energy while preserving a suitable level of data accuracy for the received data at the sink node. In this dissertation, five new distributed energy - efficient data aggregation approaches were proposed based on cluster topology. These approaches can be distributed on the sensor nodes in the monitored area of interest. More precisely, the objective of these approaches is to aggregate the sensed data at two levels : one of them at the sensor nodes level and the other on the aggregator (Cluster Head (CH)) level to prolong network lifetime in PSNs. In the sensor node level, three different energy - efficient approaches were developed; they are DADAC, EADiDaC and DiDASeF in order to remove redundant sensor readings, save energy, and prolong the network lifetime. In the fourth approach, a Two - Level Data Aggregation (TLDA) for Prolonging Lifetime of Periodic Sensor Networks is proposed. Data aggregation is achieved by using Adaptive Piecewise Constant Approximation (APCA) technique to reduce the amount of data collected by each sensor. Moreover, at the aggregator data aggregation is achieved by grouping received data sets based on the chaining hash table with SAX quantization method, as well as other processing methods. In the fifth approach, a complete Data Aggregation Framework (DAF) for maximizing the lifetime of PSNs are integrated to work together. The aggregation function, at the Cluster head (CH), works as a filtering via enabling the CH to reduce the final sets that the base station will be received. Extensive simulation experiments were conducted on real sensor data by applying OMNeT++ network simulator to explain the effectiveness of the proposed approaches in comparison with other existing methods. The results of these experiments show that DADAC approach reduced collected readings from 18% to 76% and from 5% to 29% compared to PFF and Harb respectively. The consumed energy of a sensor node using EADiDaC method is minimized from 27% to 57% and from 15% to 43% compared to PFF and Harb techniques respectively. DiDASeF approach decreased the remaining data to a maximum of 10% after applying the aggregation step at each period, whilst the rate is equal to 31% in ATP and 100% in PFF. TLDA approach decreased the consumed energy at the cluster head up to 72% and 61% in comparison with PFF and Harb methods respectively. The aggregation stage in DAF approach decreased the remaining data to a maximum of 9.322% at each period, whilst the rate is equal to 18.34% in TLDA

الاداء الامثل لشبكات الاستشعار اللاسلكية باستخدام نماذج نشر مختلفة == An Optimal Performance of the Wireless Sensor Networks Using Various Deployment Models

Author name: عبد الناصر رياض فنجان سالم
Supervisor name: سعد طالب حسون الجبوري
General topic: Computer Science
Specific topic: Software
Degree: Doctorate
Language: English
University location: Babylon
First pages:
Abstract: Wireless sensor networks (WSNs) today are widely used in various military and civilian applications and in the construction of a new concept called Internet of thinks (IoT), so it has been given great importance especially in recent years. In most WSNs applications sensors are deploying in random manner. Such randomness deployment produces trivial control on the network with no coverage guarantee and may achieve weakly connected network topology. Therefore, precise location can be often pursued for different nominated applications with the aim of configuring the topology of the network to reach to the requirements of preferred application. Most of the important WSN optimization techniques are to place the sensors in a deterministic manner to meet the required performance aims.In this dissertation several solutions are proposed to handle the deployment problem in WSN such as coverage, connectivity and reliability. Our suggestion depends on developing certain re - deployment approaches. These approaches are suggested and implemented in two virtual phases. In the first phase a random deployment was suggested then improves the locations of all the deployed sensors in the second phase. Once completing these phases a set of feasible locations will be available and can be used in the process of real sensor deployment.Seven algorithms are suggested, two of them were developed from the centralized optimization algorithms. The first is Particle Swarm Optimization (PSO), one of the common optimization methods. And the second is called Grid - distribution, where we considered this model to estimate the optimal number of sensors needed to cover a specific area. On the other hand, we have extracted two new models from Grid - distribution fundamentals, one of them to cover the border called barrier deployment, and the second is to cover center a certain area called center deployment.Three other optimization deployment algorithms are proposed to redeploy sensors after initial random deployment and improve coverage, connectivity and network reliability at the minimum cost. These algorithms are Distance based deployment, Markov based deployment and Angles based deployment. A mathematical model has been built for each of these proposed algorithms and has been implemented and tested by the Net Logo simulator. Each algorithm is executed in all sensors to achieve the desired objectives. The results of these algorithms were shown to be superior and dominate the results of existing algorithms such as Glowworm Swarm Optimization (GSO) and PSO_Voronoi.

اقتراح خوارزمية هجينة للتشفير الكتلي == Proposed Hybrid Block Cipher Algorithm

Author name: احسان احمد محمد لهمود
Supervisor name: عبد الكريم عكلة عبادي
General topic: Computer Science
Specific topic: Computer Science
Degree: Doctorate
Language: English
University location: Babylon
First pages:
Abstract: يعتبر التشفير من المجالات الجيدة في الوقت الحالي كما نعلم ان الامن شرط اساسي لاي عمل ومن اجل ذلك نحن بحاجة الى خوارزمية قوية جدا وغير قابلة للكسر لتوفير اجراءات امنية مشددة.لذلك نحن نحتاج الى خوارزمية للتشفير وفك التشفير لتوفير امنية عالية جدا وانتاجية جيدة جدا. اذا نظرنا الى العالم الحقيقي، هناك الكثير من المنظمات التي لديها قاعدة بيانات كبيرة جدا مع اجراءات امنية مشددة. وفقا للقلق الامني، تعمل بعض خوارزميات التشفير وفك التشفير لحماية المعلومات السرية مثل DES و3DES وAES وBlowfish.تم اقتراح وتصميم خوارزمية هجينة لتشفير كتلة او لفك تشفيرها مكونة من 256 بت باستخدام مفتاح بطول 288 بت. يتم تحويل كتله بطول 32 - حرف من النص الواضح او النص المشفر الى 256 بت. يتم جدولة المفتاح السري لكي يم تطبيقه في عملية التشفير وفك التشفير. يتم اخضاع كتلة النص الواضح الى عملية التقلب الاولية، وفي نهاية التشفير يتم اخضاع النص المشفر الى التقليب النهائي. تم تصميم الخوارزمية المقترحة للدمج بين اثنين من الخوارزميات (على اساس فيستيل وغير فيستيل).استخدمت في هذه الاطروحة بعض من معاير التشفير الكتلي مثل الانتاجية لتوليد كتلة مشفرة حيث حققت انتاجية الخوارزمية المقترحة قيمة 27.240 كيلوبت في الثانية. اما بالنسبة لهجمات القوة الغاشمة حيث تحتاج 1079 X 1.57سنة اذا تم تطبيقها لمهاجمة مفتاح الخوارزمية ، حققت الخوارزمية المقترحة نسبة اكثرمن ٥٠% ضمن معيار SAC حيث كانت النسبة (٥١.١٧%) وكذلك بالنسبة لمعيار BIC حيث حققت نسبة (٥٣.١٢%). تم تنفيذ الخوارزمية المقترحة باستخدام لغة البرمجة (Microsoft Visual Basic.Net 2008) وعلى حاسوب ذو مواصفات (Windows 10 pro, processor : Intel(R) core (TM) i7 - 3612QM CPU @ 2.10GHz, RAM 6.00 GB, and system type : 64 - bit operating system). | The Cryptography is very good area for research now a days. As we know that security is very primary requirement for the any business. And we need very strong and unbreakable algorithm which provides high security. We need encryption and decryption algorithm which is having very high security with very good throughput. If we look at the real world, lots of organizations are having very large database with high security. Some encryption and decryption algorithms are working behind confidential information like DES, 3DES, AES and Blowfish.A proposed hybrid algorithm designed to encrypt or decrypt block of a message that consisting of 256 - bit with control of a 288 - bit as a key length. The blocks constructed by converting a 32 - charecter block of plaintext or ciphertext into 256 - bit. The secret key is scheduled to be applied to encrypt and decrypt. Plaintext block will be subjected to an initial permutation IP, and final permutation. The proposed algorithm designed in a fashion which belongs on two algorithms (based on Feistel and Non - Feistel). In this dissertation, some components used like throughput of generate encryption block. It has achieved as 27.240 Kbps. Based on brute force attacks may be applied on this algorithm where it needs 1.57x1079 years to attack the applied key, the security is provided in this algorithm achieved results more than 50% within criteria of SAC is (51.17%) and BIC is (53.12%). The proposed algorithm were implemented using the programming language (Microsoft Visual Basic.Net 2008) within computer information of (Windows 10 pro, processor : Intel(R) core (TM) i7 - 3612QM CPU @ 2.10GHz, RAM 6.00 GB, and system type : 64 - bit operating system)

تقييم الية الثقة في شبكات المركبات == Evaluation of Trust Mechanism for VANETs

Author name: حوراء عادل نوري
Supervisor name: ستار بدر سدخان المالكي
General topic: Computer Science
Specific topic: Computer Science
Degree: Doctorate
Language: English
University location: Babylon
First pages:
Abstract: تدعم شبكة المركبات العديد من التطبيقات التجارية كانظمة النقل الذكية (ITS)، ولكن كان الدافع الاساسي وراء هذه الشبكات هو سلامة اتصالات الطريق الذي تعتمد فيه كل مركبة على الرسائل المرسلة لها من قبل نظائرها من المركبات الاخرى والتي قد تكون ضارة. ان الطبيعة المتغيرة والديناميكية لطبولوجيا الشبكة يجعل بامكان اي مركبة مغادرة الشبكة والانضمام اليها في اي وقت سواء كانت هذه المركبات موثوق بها ام لا. لذا يجب ان تتمكن كل مركبة من تقييم المعلومات الواردة لها من المركبات الاخرى واتخاذ القرارات بشانها والاستجابة لتلك المعلومات. عليه فبدون انشاء اليه مناسبة لادارة الثقة فان الاتصالات في هذه الشبكات قد تكون عرضه للتهديد الامني، حيث توجب الانظمة الامنية ان ياتي الارسال من مصدر موثوق لذا فان الثقة والامن مفهومان مترابطان لا يمكن عزلهما.لم يتحقق حتى الان تطوير نماذج امنة تماما لهذه الشبكات، لذا يهدف مجال البحث الجيد الى استثمار معظم الطرق السابقة في المؤلفات للبحث عن اطار عام لوضع اساس متين لتطوير الية احتساب السمعة والموثوقية في شبكات المركبات. يدعم هذا العمل امن شبكات المركبات من خلال استخدام تقنية الخوارزمية الجينية بالاضافة لنظرية اللعبة لتطوير الية ثقة متعددة الخصائص. | VANET support many commercial applications such as Intelligent Transportation Systems (ITS), but the original motivation behind it was safety of road communications where each vehicle has to rely on messages sent out by peer vehicles, which might be malicious. The dynamic changing nature of network topology makes any vehicle to leave and join the network at any point of time whether these vehicles were trusted or untrusted. Therefore, each vehicle must be able to assess, make decisions and respond to information received from other vehicles. So without having a proper mechanism for trust management, communication in VANET might be prone to security threat. Security systems impose that the transmission come from a trusted source, so trust and security are two interdependent concepts that there cannot be segregated.The development of fully secure schemes for these networks has not been entirely achieved till now. So, a good research field aims to exploit most of the previous approaches in literatures looking for a general framework to put solid basis to the development of Distributed Trust and Reputation Mechanism for VANET. The work supports the security of VANET by using a genetic algorithm technique in addition with game theory to develop a multi - featured trust mechanism

تحسين خوارزمية تشفير A5/1 بالاعتماد على تقنية الترشيح لتطبيق انترنيت الاشياء == Improvement of A5/1 encryption algorithm based on filtration technique for IoT Application

Author name: زينب حمزة جاسم
Supervisor name: ستار بدر سدخان المالكي
General topic: Computer Science
Specific topic: Computer Science
Degree: Master
Language: English
University location: Babylon
First pages:
Abstract: The Internet of Things (IoT) is an environment in which people, animals or objects are equipped with individual identities and have the ability to transmit data across the network without the need for human - to - human or human - to - computer interaction.Security of IoT is very important because it is used in many fields and will have a big impact on the IoT industry. Internet of Things is similar to conventional computer networks, so security requirements such as confidentiality, integrity, availability and non - repudiation must be taken into account in building a network environment. One of appropriate solutions for providing security in IoT is cryptography. At present, traditional cryptography solutions focus on producing high levels of security, but they are slow in speed, large in size and consume a loT of energy, ignoring the conditions of constrained devices that use in IoT. These devices require appropriate cryptographic algorithms to suitable their characteristics, and this considers as big challenge.In this thesis, we propose a modification of the A5 /1 stream cipher to Internet of Things (IoT) by adding a fourth register and applying a filtration function on registers to increase the linear complexity of the algorithm and to strengthen the linear combination function (XOR) with remain total number of registers is 64 - bit. A5/1 Stream cipher is considered an efficient implementation of hardware, but insecure for use in such IoT applications. So we take efficiency implementation of hardware of A5/1 to produce proposed algorithm with the highest security, also efficient in hardware, and suitable for application in resource devices environments such as the Internet of Things. To make sure that the proposed algorithm as lightweight and can be applied to the constrained devices used within IoT, we have

طريقة تحليلية لانظمة التشفير الصوتي البايومتري == Analytical Approach of Biometric Based Voice Encryption System

Author name: علي كاظم مطر
Supervisor name: ستار بدر سدخان المالكي | بهيجة خضر شكر
General topic: Computer Science
Specific topic: Computer Science
Degree: Doctorate
Language: English
University location: Babylon
First pages:
Abstract: There is no absolute security for important systems can ever get because attackers have always the ability to broke and attack them through their disadvantages. These days, biometrics is used to raise protection rate compared with the traditional methods. Authentication systems and cryptosystems are some of the important aspects of the practical life that use biometrics. The biometric voice is one of these traits that can build suitable secure systems according to the varying in the biometric voice.In this dissertation, two proposed analyzers were introduced to analyze Authentication system of biometric voice and the encryption process of the cryptosystems. The Authentication analyzer was used Additive White Gaussian Noise (AWGN) to stimulate effect of background/ transmission channel noise, and analyze the behaviors of the authentication system using FAR and FRR biometric performance measures.Performing proposed Authentication analyzer found degradation in the accuracy about (9.6% to 19.2%) in Splashdata database, about (1.9% to 5.7%) in Texas Instrument of Massachusetts Institute and Technology (TIMIT) database, and 0% in Texas Instruments - Digits (TIDIGITS) database of all selected members cannot be rejected illegally even when AWGN was reached 20 dB. SNR. Also, performing proposed Authentication analyzer found that the highest security degradation was about 0.05769 in Splashdata database, 0.01923 in TIMIT database and 0.05769 in TIDIGITS database of all selected members even when AWGN was reached 20 dB. SNR.The second proposed analyzer (Encryption analyzer) was also tested on the same databases to analyze them according to three randomness tests from National Institute of Standards and Technology (NIST) packages (pre - encryption phase), then these databases were also tested using Cross - correlation and Chi tests (post - encryption phase). These two phases produced two results by implementing two Mamdani fuzzifiers to get the certainty of each result. The final output of proposed Encryption analyzer was produced by merging the two previous Mamdani fuzzifiers in another final Mamdani fuzzifier.The performance of the Encryption analyzer was proved by classifying good/bad Keystream using the (post - encryption tests) and also with the comparison of the average value of other different 5 randomness tests from NIST.Finally, the ANFIS structure was used to generalize the hidden relationships that trained from the three randomness tests (pre - encryption process). The generalization process made ANFIS having the ability to predict the values of unseen (untrained) patterns. ANFIS results were promising results according to the proposed Encryption analyzer.Chapter

تحسين نظام مقترحات هجين باستخدام خورازمية الترتيب PageRank == Hybrid Recommender System Enhancement Using Personalized PageRank Algorithm

Author name: حیدر مجید ناجي
Supervisor name: غیداء عبد الحسین بلال
General topic: Computer Science
Specific topic: Information Technology
Degree: Master
Language: English
University location: Babylon
First pages:
Abstract: Recommendation system is an information filtering system. PageRank Algorithm is useful method for the recommendation task. PageRank algorithm is used to improve the representation of movies and users in the graph network in addition to ranking movies for a target user in the recommendation activity. User preferences has been calculated based on movies genres as a part of building the user profile from his past history of rating (content analysis), and for each user, this preference was used to produce a personalized initial pagerank value for each movie instead of the traditional static equal initial pagerank value which is the first stage of iterative personalize pagerank algorithmIn addition to personalize the target user, new way has been presented to personalize each user with different weight according to them rating on movies, by supporting the proposed recommender system with a new personalize parameters for each user, which is the manner of the collaborative filter approach.To evaluate the performance of the proposed recommender system and measure the accuracy of recommendations, precision, recall and F - Measure metrics has been used. MovieLens2K dataset used to evaluate the recommendation system, it has 10,197 movies and 2,113 users, in average of 85 movie rating per user.The experimental results showing that, there is a significant improvement for the recommendations process, which is mean hybrid recommender system using personalized pagerank (HRS - PPR) is better than the traditional recommender system using personalized pagerank.

استخدام تقنية الحساب المرن لتقييم RSA وAES == Soft Computing Technique to Evaluate RSA and AES

Author name: فرقد حامد عبد الرحیم
Supervisor name: ستار بدر سدخان المالكي
General topic: Computer Science
Specific topic: Computer Science
Degree: Doctorate
Language: English
University location: Babylon
First pages:
Abstract: Security evaluation algorithms can be considered as one of the most important challenges in computer networks. This is because of the growing data sharing among all clients (users). Therefore, the security level evaluation aspect of cryptography systems is recently appeared to be very important.In this work, evaluations of (RSA and AES) encryption methods are carried out by using Fuzzy Inference System (FIS) and Adaptive Neuro - Fuzzy Inference System (ANFIS). The editor of MATLAB (2013) is employed in this study and it contains a hybrid ANFIS facility between the Artificial Neural Network (ANN) and Fuzzy Logic techniques.First of all, designing and programming software codes for the first encryption method (RSA) have been simulated according to its original algorithm. Consequently, executing the RSA algorithm to collect the data values is implemented for the following parameters (message length, execution time, length of key and cipher message entropy). These parameters have been considered in the proposed approaches. So, the RSA data is used as the bases of the FIS inputs. Then, all the training and testing data values have been collected from the proposed FIS and prepared to be used in the next step (the ANFIS). The number of training samples has been selected to be 100 values by executing special software programs. These values have been utilized as follows : opening the ANFIS editor; loading the training data; determining the main ANFIS parameters and training the data with the least error tolerance. Subsequently, the number of testing samples has been chosen to be also 100 values by implementing special software programs. Hence, the evaluations are observed and the characteristics of the ANFIS which attained the best tested results have been benchmarked. Similar steps to evaluate the RSA by using large key numbers are implemented except of utilizing the parameter (key length) to study the influence of the key value on security evaluations. The proposed FISSecurity evaluation algorithms can be considered as one of the most important challenges in computer networks. This is because of the growing data sharing among all clients (users). Therefore, the security level evaluation aspect of cryptography systems is recently appeared to be very important.In this work, evaluations of (RSA and AES) encryption methods are carried out by using Fuzzy Inference System (FIS) and Adaptive Neuro - Fuzzy Inference System (ANFIS). The editor of MATLAB (2013) is employed in this study and it contains a hybrid ANFIS facility between the Artificial Neural Network (ANN) and Fuzzy Logic techniques.First of all, designing and programming software codes for the first encryption method (RSA) have been simulated according to its original algorithm. Consequently, executing the RSA algorithm to collect the data values is implemented for the following parameters (message length, execution time, length of key and cipher message entropy). These parameters have been considered in the proposed approaches. So, the RSA data is used as the bases of the FIS inputs. Then, all the training and testing data values have been collected from the proposed FIS and prepared to be used in the next step (the ANFIS). The number of training samples has been selected to be 100 values by executing special software programs. These values have been utilized as follows : opening the ANFIS editor; loading the training data; determining the main ANFIS parameters and training the data with the least error tolerance. Subsequently, the number of testing samples has been chosen to be also 100 values by implementing special software programs. Hence, the evaluations are observed and the characteristics of the ANFIS which attained the best tested results have been benchmarked. Similar steps to evaluate the RSA by using large key numbers are implemented except of utilizing the parameter (key length) to study the influence of the key value on security evaluations. The proposed FISSecurity evaluation algorithms can be considered as one of the most important challenges in computer networks. This is because of the growing data sharing among all clients (users). Therefore, the security level evaluation aspect of cryptography systems is recently appeared to be very important.In this work, evaluations of (RSA and AES) encryption methods are carried out by using Fuzzy Inference System (FIS) and Adaptive Neuro - Fuzzy Inference System (ANFIS). The editor of MATLAB (2013) is employed in this study and it contains a hybrid ANFIS facility between the Artificial Neural Network (ANN) and Fuzzy Logic techniques.First of all, designing and programming software codes for the first encryption method (RSA) have been simulated according to its original algorithm. Consequently, executing the RSA algorithm to collect the data values is implemented for the following parameters (message length, execution time, length of key and cipher message entropy). These parameters have been considered in the proposed approaches. So, the RSA data is used as the bases of the FIS inputs. Then, all the training and testing data values have been collected from the proposed FIS and prepared to be used in the next step (the ANFIS). The number of training samples has been selected to be 100 values by executing special software programs. These values have been utilized as follows : opening the ANFIS editor; loading the training data; determining the main ANFIS parameters and training the data with the least error tolerance. Subsequently, the number of testing samples has been chosen to be also 100 values by implementing special software programs. Hence, the evaluations are observed and the characteristics of the ANFIS which attained the best tested results have been benchmarked. Similar steps to evaluate the RSA by using large key numbers are implemented except of utilizing the parameter (key length) to study the influence of the key value on security evaluations. The proposed FISapproach confirmed that the RSA evaluation is successfully implemented to the ANFIS editor.All the previous steps are repeated for the AES encryption method except one difference. That is, the utilized parameters here are the (message length, execution time and cipher message entropy). Basically, two key values are determined for the AES, which equals to 128 bits. Likewise the RSA, the suggested procedures are applied to the AES and the proposed FIS approach confirmed that the AES evaluation is successfully implemented to the ANFIS editor.Finally, comparisons between this study and previous work, and between the RSA and AES are established. In addition, comparisons between the evaluated outcomes of the FIS and ANFIS have been investigated by using two statistical metrics.

عنقدة الصور اعتمادا على طريقة كسورية مطورة وتنقيب المخططات == Image Clustering Based on Developed Fractal Method and Graph Mining

Author name: فراس صبار مفتن
General topic: Computer Science
Specific topic: Computer Science
Degree: Doctorate
Language: English
University location: Babylon
First pages:
Abstract: تشير عنقدة الصور الى تقسيم الصور الى عدة مجاميع. حيث كل مجموعة تسمى عنقود حيث يحتوي على صور متشابه في الخصائص ولكنها مختلفة عن الصور في العناقيد الاخرى. يمكن تفسر الخصائص الشاملة كميزات احصائية على انها خاصية للصورة تشمل جميع وحدات البكسل المستخدمة لحساب التشابه بين الصور. استخدمت هذه الاطروحة الكسور كخصائص محلية لتمثيل الصورة تستند الى مناطق بارزة في حين تبقى ثابتة لتغير نقطة النظر والاضاءة. تعتبر الكسور شائعه لقدرتها على استخراج ميزة التشابه الذاتي. ولفترة طويلة، استخدم الباحثون الكسور لضغط الصورة. على مدى السنوات الاخيرة، تم تطبيقها في التنقيب على البيانات. لهذه الاطروحة هدفين رئيسيين : اولا لدراسة القدرة على استخراج خصائص التشابه الذاتي من الصور دون استخدام بعد الكسور والذي يعتبر حساس للضوضاء العددية او التجريبية ومقيد بكمية البيانات. وثانيا لبناء الرسم البياني على اساس الميزات المستخرجة وتطور خوارزمية تجميع بالاعتماد على الرسم البياني.وينقسم النظام المقترح الى مرحلتين، بناء مصفوفة التشابه بواسطة طريقة كسورية وخوارزمية تنقيب المخططات. تم تطبيق PIFSلاستخراج ميزات التشابه الذاتي من صورة واحدة فقط. ولكن في هذه الدراسة كيفت PIFS لاستخراج ميزات التشابه الذاتي من العديد من الصور. بسبب ان PIFS تستغرق وقتا طويلا، فقد تم تكييفها للعمل مع تقنيات المطابقة والتقليل، وايضا تم استخدام الدالة الهاش للحد من تعقيد الوقت. واستخدم النظام المقترح مصفوفة تشابه لبناء المخطط ووضع خوارزمية عنقدة شبكية تعتمد على خصائص كسورية التوصيل بين العقد التي تمثل صور.استخدمت عدة بيانات لاختبار النظام المقترح. ولان النظام ينقسم الى مرحلتين، الاولى بناء مصفوفة التشابه والثانية هي خوارزمية تجميع الرسم البياني. لذلك، تم اختبار كل مرحلة بشكل منفصل. في الاول، يتم اختبار بناء مصفوفة التشابه (الميزات المستخرجة) مع خوارزمبة K - means لمعرفة صحة الميزات المستخرجة.وتم اقتراح طرائق لتقليل وقت التنفيذ ومقارنتها مع الطرائق التقليدية. وخفضت دالة الهاش التعقيد من O(m×n) الى O(m log⁡n) بينما قللت المطابقة والتقليل التعقيد الى O(m×n/t) حيث t عدد دوال المطابقة.اما طريقة التجميع البيانية المقترحة تم اختبار صحتها باستخدام البيانات الحقيقية واستخدمت المقاييس النمطية، الموصلية، التغطية، وكثافة الجودة وتم عرض النتائج والتحقق من صحتها من الناحية العددية والبصرية مع عدد عقد المختلفة. وقد اظهرت النتائج التي تم الحصول عليها دقة بين 0.80 و0.99 لجميع المقاييس.واظهرت النتائج ان للكسور قدرة كبيرة على استخراج ميزة التشابه الذاتي لاستخدامها في التنقيب عن الصور مثل التجميع. واعطت خصائص التشابه الذاتي كسورية نتائج جيدة. وان الميزات المستخرجة مشابه الى مصفوفة المجاورة التي يتم استخدامها لتمثيل الرسم البياني. لذلك، تعتبر بنية جيدة لتمثيل الرسم البياني. | Image clustering refers to the division of images into various sets of images. In this regard, each set known as cluster includes images that are similar in features to each other but different those of other sets. The global features as statistical features can be interpreted as a particular property of image involving all pixels were used to calculating similarity among images by most of the researchers. This thesis used fractal features as local features to represent an image based on salient regions while remaining invariant to viewpoint and illumination changes. Fractal is popular because of their ability to extract the self - similarity feature. For a long time, researchers used fractals for image compression. Over the latest years, they have been applied in mining. This thesis has two major purposes, first to studies the ability to extract fractal Self - similarity features from images without using fractal dimension which is sensitive to numerical or empirical noise and limitations in the amount of data. Second to constructs graph based on extracted features and develops graph cluster algorithm.The proposed system is divided into two phases, the Similarity Matrix construction by a fractal method and a Graph Clustering algorithm. Partitioned Iterated Function Systems (PIFS) is applied to extracting Self - similarity features from just one image. This study developed PIFS to extracting Self - similarity features from many of images. Since the PIFS algorithm is time - consuming, it has been adapted to work with Map - Reduce techniques and also hash function was used to reduce the time complexity. The proposed system used similarity matrix to construct a graph structure and developed a graph clustering algorithm based on connectivity fractal features among nodes that represents as images.Each phase was tested Separately. In the first phase, Similarity Matrix construction (features extraction) is tested with K - means clustering algorithm to find out the correct features extracted. The B - Cubed recall and precision are estimated with good results to precision and recall accuracy.Then proposed methods of reducing time complexity results is presented and compared with traditional methods. The hash function reduced the complexity O(m×n) to O(m log⁡n) while Map/reduce technique reduce the complexity O(m×n) to O(m×n/t) for time where t is a number a of map task.The second phase, Graph Clustering algorithm is tested with the real - world graph dataset. The clustering result was evaluated by Modularity, Conductance, Coverage, and Density Quality Metrics and the results were presented and validated both numerically and visually with different nodes number. The obtained results have shown accuracy between 0.80 and 0.99 for all metrics.

نظام الكشف التعاوني عن هجومات الفيضان الموزعة للحرمان من الخدمة والتعقب المستوحى من مجتمع العناكب الاجتماعية == Collaborative Detection System of DDoS Flooding Attacks and Tracing Inspired by Social Spiders Society

Author name: عادل محمد سلمان القريشي
Supervisor name: صفاء عبيس المعموري
General topic: Computer Science
Specific topic: Computer Science
Degree: Doctorate
Language: English
University location: Babylon
First pages:
Abstract: لا تزال شبكة الانترنيت تعاني من المشاكل الامنية التي تهم بشكل رئيسي الاشخاص الذين يستخدمون اجهزتهم للاتصال بالانترنت، سواء كانوا افراد او مؤسسات كبيرة. الهجمات الموزعة للحرمان من الخدمة، لا تزال واحدة من اهم المواضيع التي يتم مناقشتها حاليا في تهديدات امن الشبكات للشركات التي تقدم الخدمات لعملائها. في هذه الاطروحة، تم اقتراح نظام الكشف التعاوني. واستند على مرحلتين : (1) مرحلة الكشف؛ (2) مرحلة التعقب. اعتمادا على الفكرة المستوحاة من مجتمع العناكب الاجتماعية، تم تصنيف اجهزة التوجيه الى نوعين، على النحو التالي : (1) جهاز التوجيه الذكر، الذي هو مرتبط مباشرة مع الخادم؛ (2) جهاز التوجيه الانثى، والذي هو كل جهاز توجيه غير مرتبط مباشرة مع الخادم. ويتميز النظام المقترح بانه حل قائم على جهاز التوجيه وعلى فحص التدفقات.يمكن تقسيم مرحلة الكشف الى اربع خطوات، على النحو التالي : (1) جمع البيانات؛ (2) معالجة البيانات واستخراج الميزات؛ (3) بناء نموذج التصنيف، باستخدام خوارزمية شجرة القرار عالية السرعة (VFDT) كخطوة للكشف المبكر، والتي سيتم استخدامها من قبل كل جهاز توجيه انثى في الشبكة؛ (4) كشف الشذوذ (الهجوم) باستخدام خوارزمية الغابات العشوائية (RF) للتصنيف، والتي سيتم تنفيذها في كل جهاز توجيه ذكر. الجمع بين هاتين الخوارزميتين سوف ينتج عنه خوارزمية تصنيف جديدة تسمى هوفدينغ الغابات العشوائية (HRF).تبدا مرحلة تتبع مصادر الهجوم عندما يتم العثور على بيانات الهجوم. جهاز التوجيه الذكر القريب من الخادم الضحية سوف يتتبع مصادر الهجوم بالاعتماد على قيمة الاهتزاز للتدفق، ثم رفع الانذار وارسال جميع المعلومات الى مسؤول الشبكة لاتخاذ الاجراءات اللازمة. وقد استلهمت قيمة الاهتزاز من مجتمع العناكب الاجتماعية، والذي هو قيمة تاثير جهاز التوجيه الانثى على كل تدفق يمر من خلاله.وقد تم استخدام برنامج محاكاة شبكة NS3 لتوليد بيانات الشبكة. ثم الحصول على النتائج واختبار النظام بواسطة برنامج مبرمج باستخدام لغة C++. وعلاوة على ذلك، طبقت عدة تجارب، وتم اعتماد تجربتين لاختبار النظام المقترح، الاول هو 90 ثانية، في حين ان الثانية هي 1200 ثانية. اجريت هذه التجارب لتوليد البيانات العادية وكذلك توليد بيانات هجوم الفيضان الموزع للحرمان من الخدمة للنوعين TCP وUDP. تم اختبار البيانات التي تم توليدها لاثبات ما اذا كانت مشابهة للبيانات الحقيقية عن طريق اختبار اثنين من الخصائص التي هي التباين العالي والتشابه الذاتي. وقد اظهرت النتائج ان البيانات التي تم توليدها لها نفس خصائص البيانات الحقيقية، وتمت الموافقة على نسبة حوالي 95٪.بالاضافة الى ذلك، لتقييم اداء خوارزمية هرف الجديدة، تم استخدام ثلاثة تدابير : (1) نسبة دقة التصنيف، والتي كانت 99.9983٪ و99.9990٪ على التوالي لكل من التجارب (90 ثانية و1200 ثانية). (2) معدل الكشف، والتي تبين 9.9996٪ و99.9997٪، على التوالي، لكلا التجربتين. و(3) نسبة الانذار كاذب، كان 0.016٪ و0.0088٪ على التوالي لكلا التجربتين. وكان متوسط وقت الكشف 21.71 و28.46 ثانية لكل من التجارب على التوالي.يستخدم النظام المقترح مبدا تقليل السمات المستخدمة في التصنيف، مما ادى الى انخفاض في حجم الذاكرة المستخدمة بنسبة 62.96٪ وانخفاض في مساحة القرص الثابت المستخدم بنسبة 51.75٪.واخيرا، في عملية البحث عن المفقودين، والوصول الى اقرب جهاز التوجيه الاناث الى مصدر الهجوم، حيث تم تحديد معظم هذه الموجهات، لكلا التجربتين، مع نسبة 100٪. | The Internet still suffers from security problems which are the main concern for those connected via their devices, whether they are individuals or institutions. The Distributed Denial of Service (DDoS) attacks are still one of the most significant current discussions regarding network security threats for companies providing services to their clients.In this dissertation, a collaborative detection system which proposed is based on two parts : (1) the Detection phase, and (2) the Tracing phase. Inspired by the social spider’s society, the routers were classified into two types : (1) Male router, which is near the server and directly connected with it; and (2) Female router, which is near the user and directly connected with it or between the user and the server. The proposed system is characterized as a router - based and flow - based solution.The detection phase can be divided into four steps : (1) data collection; (2) data preprocessing and extraction of features; (3) building the classification model, using a Very Fast Decision Tree (VFDT) algorithm as an early detection step, which will be used by each female router in the network; and (4) anomaly (attack) detection using the Random Forest (RF) algorithm for classification, which will be implemented in each male router. The combination of these two algorithms will generate a new classification algorithm called the Hoeffding Random Forest (HRF).The tracing phase will be started when the attack data is found. The male router near the victim server will trace the attack sources based on the value of the vibration of the flow, then raise the alarm and send all the information to the network administrator, to take an action. The vibration value has been inspired by the social spider’s society, which is the effect of the female router on each flow passing through it.NS3 network simulation software has been used to generate the network data. Then obtain the results and test the system by a software programmed by C++. Moreover, several experiments were applied, and two experiments were adopted to test the proposed system; the first is 90 seconds, while the second is 1200 seconds. These experiments were performed to generate normal data and DDoS flooding attack data for TCP and UDP types. The generated data has been tested to prove if it is similar to the real data by testing two critical characteristics : high - variability and self - similarity. The results show that the generated data has the same characteristics as the real data, and is approved with ratio approximately 95%.Additionally, to evaluate the performance of the new HRF algorithm, three measures have been used : (1) classification accuracy ratio, which was 99.9983% and 99.9990% respectively for both experiments (90 sec. and 1200 sec.); (2) detection rate, showing 9.9996% and 99.9997%, respectively, for both experiments; and (3) false alarm, was 0.016% and 0.0088% respectively for both experiments. The average of the detection time was 21.71 and 28.46 seconds for both experiments respectively.The proposed system uses the principle of reducing the features that used in the classification, which led to a reduction in the used memory size by 62.96% and a reduction in the used hard disk space by 51.75%.Finally, in the tracing process, accessing the nearest female router to the source of the attack, where most of these routers have been identified, for both experiments, with ratio 100%.

اخفاء المعلومات في صفحات الويب الهجينة == HYBRID STEGANOGRAPHY OF WEBPAGE

Author name: رسل عامر عبد المحسن
Supervisor name: وسام سمير بهية
General topic: Computer Science
Specific topic: Information Technology
Degree: Master
Language: English
University location: Babylon
First pages:
Abstract: اخفاء المعلومات هو علم اخفاء البيانات والمعلومات السرية في غطاء رقمي مثل ملفات نصيه او ملفات صوتيه او ملفات الفديوا او صوره او تاك بحيث يصعب على المشاهد العادي على معرفة وجود رسالة مخفية فيه. في هذه الرسالة تم اقتراح طرق جديده لاخفاء البيانات السرية والمهمة بالاعتماد على خوارزمية الاخفاء بالنص والصورة والتاك.ويتكون النظام المقترح من ثلاث مراحل. المرحلة الاول هي تحميل صفحه (webpage)، والمرحلة الثانية هي تحليل صفحة webpage))، نحلل الصفحة حتى نرى النسبة الاكثر التي تتكون منه الصفحة فيما اذا كان (نص او صوره او تاك)، والمرحلة الثالثة هي الاخفاء اما نخفي بالنص او الاخفاء بالنص او الاخفاء بالتاك. الاخفاء بالنص يتم من خلال تحويل الرساله السريه المراد اخفاءها الى (binary) وبعد ذلك نقوم باخفاء (bits) السريه في النص الموجود في صفحة الويب التي قمنا بتصميمها اذا كان الدينا ل(1) نكبر اول حرف من كل كلمة بدرجه واحده فقط بحيث تكون غير جالبه للشك اما اذا كان لدينا (0) نصغر اخر حرف من كل كلمة بدرجه واحده فقط من النص الموجود في صفحة الويب. اما الاخفاء بالصورة يتم من خلال تحويل الرسالة السري الى (binary) وبعد ذلك نقوم باخفاء (bits).اذا كان لدينا الbit(1) يتم اخفاءها في حال كان pixel)) في الاطار الاول والاطار الثاني زوجي اما اذا كان لدينا bit(0) يتم اخفاءها في حال كان pixel)) في الاطار الاول والاطار الثاني فردي.الاخفاء بالتاك يتم من خلال تحويل النص السري الى encoding) (وبعد ذلك نقوم باخفاء(bits) في التاك وهذه العملية تتم من خلال اذا كان (1) نجعل اول حرف من التاك كبير واذا كان (0) نجعل اول حرف من كلمة صغير. | Information hiding is a science of hiding data and secret information in digital cover such as (texts files, images or tags files), where difficult for the normal viewer to know the presence of a hidden message in it. This thesis suggests a method to hide the secret and important information based on Steganography.Sending encrypted messages frequently will draw the attention of third parties, i.e. crackers and hackers, perhaps causing attempts to break and reveal the original messages, in a digital world, Steganography is introduced to hide the existence of the communication by concealing a secret message inside another unsuspicious message.In this thesis, we have worked with data hiding techniques in (text, image and tags) of Internet webpages. In particular, we will propose an idea of using three Steganography techniques to hide secret information in (text, image and tags) of webpages. In this thesis, the webpage will be analyzed to check the size of different contents of webpages (text, images, and tags). Then, we will hide secret data in one or more contents of webpages depend on capacity of webpage contents and information which want to be hide. When hiding in the text by conversion the secret message to the binary, the hide secret bit (1) by enlarging size the first letter of each word to one degree only in cover text, either in case hide the secret bit (0) we work on reduce size the last letter of each word to one degree only in cover textIn addition, we propose a method of Steganography to hide text message in the image that is exist in the webpage through the conversion of secrete text to binary and then you will hide the bits in the frame of the image. In addition, we propose a Steganography in the Tags of the webpages, by encoding secrete bits and then hide these bits through tags cover webpages. Changing the letters of tags to uppercase letters and small case letters according to secrete bits. the propose technique characterized by highly capacity since we can hide more data when hiding in text, tags and images
1 ... 97 98 99 100 101 ... 147