Do you want to publish a course? Click here

تعمية معطيات تلفزية باستخدام خوارزمية المسح SCAN و تنفيذها على بطاقة FPGA و مقارنتها مع خوارزمية التعمية المعيارية AES

567   0   17   0 ( 0 )
 Publication date 2016
and research's language is العربية
 Created by Shamra Editor




Ask ChatGPT about the research

No English abstract

References used
Roshni Padate, Aamna Patel. “Image encryption and decryption using AES algorithm”, INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATION NGINEERING & TEcHNOLOGY (IJECET), 2015
M.A. Murillo-Escoba, C. Cruz-Hernández, F. Abundiz-Pérez, R.M. López-Gutiérrez, O.R. Acosta Del Campo. “A RGB image encryption algorithm based on total plain image characteristics and chaos”, ScienceDirect, Signal Processing , Volume 109, April 2015, Pages 119–131
Yuanmei Wang, Tao Li. “Study on Image Encryption Algorithm Based on Arnold Transformation and Chaotic System”, IEEE, Intelligent System Design and Engineering Application (ISDEA), 2011
rate research

Read More

We take an IDEA Algorithm and add to it some stages depend on BBM to get an Enhanced Algorithm, which had 3keys, 128-bit input block.
This paper introduces a new algorithm to solve some problems that data clustering algorithms such as K-Means suffer from. This new algorithm by itself is able to cluster data without the need of other clustering algorithms.
In this paper, we introduce a modification to fuzzy mountain data clustering algorithm. We were able to make this algorithm working automatically, through finding a way to divide the space, to determine the values of the input parameters, and the stop condition automatically, instead of getting them by the user.
In this paper, we introduce a modification to fuzzy mountain data clustering algorithm. We were able to make this algorithm working automatically, through finding a way to divide the space, to determine the values of the input parameters, and the stop condition automatically, instead of getting them by the user.
Scheduling tasks on multiprocessors is considered one of the most important issues studied to make processors operate without inertia (idleness) and thus to reduce the total time of completion or makespan. This increased interest in studying schedul ing and its algorithms, especially in multiprocessor systems that need to arrange the tasks to been optimally implemented. In this research, we study the static scheduling issue for the independent tasks on a homogenous multiprocessor system. In addition, we develop an algorithm based on Bees Colony Optimization to solve the scheduling Problem. Thereafter, our algorithm is compared with a previous one inspired also by the bees behavior for the same purpose, and the optimal solution for the displayed scheduling Problem. The aim of the algorithm is to find an acceptable solution with the best time through Bees Colony's algorithm. To evaluate our reach, we Study the effect of increasing the number of tasks when processors numbers are constant, and the impact of increasing the number of processors for a number of tasks on the stability of the presented algorithm. Our algorithm has shown the ability to obtain optimal value for the objective function in terms of scheduling tests for small and medium size. Our results shown that the imposed algorithm gives the best solution for the scheduling problem, in most cases, and improves the traditional BCO algorithm.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا