Dr. Mohammed Alia
About University
Al-Zaytoonah Private University of Jordan (henceforth, Al-Zaytoonah) was established in 1993 after receiving its license and general accreditation by Decision No. 848 on March 6, 1993. Instruction began on September 6, 1993, and since then Al-Zaytoonah has witnessed ... Read more
Academic & Administrative Staff
There are 300 faculty members of various ranks distributed among the six faculties of the University, and 80 teaching and research assistants and lab technicians. In addition, there are 210 administrative employees and 260 workers.

Al Zaytoonah University of Jordan

Blog

A NOVEL IMAGE STEGANOGRAPHIC SYSTEM BASED ON EXACT MATCHING ALGORITHM AND KEY-DEPENDENT DATA TECHNIQUE

Steganography is defined as the art of hiding secret information, which is used to guarantee information is accessible only by authorized parties who has the secret key and is inaccessible to others. The least-significant bit (LSB) approach is one of the most important scenarios in steganography. However, the most current LSB approaches should apply some changing in the image’s pixels values, which make the image suspected by intruders and hackers. This paper proposed an image Steganographic system based on the exact matching between the image’s pixel values and the secret data. As well as, a random key-dependent data (RKDD) in the proposed system is then generated without performing any modifications on the image’s pixel values. Moreover, the proposed system has been tested successfully on numerous images giving ultimate results. These significant results can be perceived in terms of fast searching time, a great number of matches, reduced the key size, achieving steganography performance criteria, invisibility, payload/ capacity and robustness.

The Parallelized Header Matching Algorithm for Intrusion Detection Systems

3rd  International Conference on Islamic Applications in Computer Science And Technology, 1-3 Oct 2015, Turkey

Abstract

 With the rapid evolution of the Internet and its applications, the current used network intrusion detection systems (NIDS) are becoming inefficient because of the amount of the traffic that needs to be processed daily. Moreover, current used NIDS implementations are inadequate to process all the traffic in real time. Therefore, the main objective of this paper is to enhance the speed of engine detection in real time for packet header in NIDS. We proposed a new parallelized matching algorithm for intrusion detection system called distributed packet header matching algorithm (DPHM). This algorithm can be run on a single processor or multiple-cores platform.

 

Real-Time Group Face-Detection for An Intelligent Class-Attendance System

I.J. Information Technology and Computer Science

 

Abstract—The traditional manual attendance system wastes time over students’ responses, but it has worked well for small numbers of students. This research presents a real-time group face-detection system. This system will be used later for student class attendance through automatic student identification. The system architecture and its algorithm will be described in details. The algorithm for the system was based on analyzing facial properties and features in order to perform face detection for checking students’ attendance in real time. The classroom’s camera captures the students’ photo. Then, face detection will be implemented automatically to generate a list of detected student faces. Many experiments were adopted based on real time video captured using digital cameras. The experimental results showed that our approach of face detection offers real-time processing speed with good acceptable detection ratio equal to 94.73%

 

Eigen Faces and Principle Component Analysis for Face Recognition Systems: A Comparative Study

ABSTRACT
Face recognition has been largely used in biometric field as a security measure at air ports, passport verification, criminals’ list verification, visa processing, and so on. Various literature studies suggested different approaches for face recognition systems and most of these studies have limitations with low performance rates. Eigenfaces and principle component analysis (PCA) can be considered as most important face recognition approaches in the literature. There is a need to develop algorithms and approaches that overcome these disadvantages and improve performance of face recognition systems. At the same time, there is a lack of literature studies which are related to face recognition systems based on EigenFaces and PCA. Therefore, this work includes a comparative study of literature researches related to Eigenfaces and PCA for face recognition systems. The main steps, strengths and limitations of each study will be discussed. Many recommendations were suggested in this study

Mobile Payment Method BASED ON PUBLIC-KEY CRYPTOGRAPHY

ABSTRACT

Mobile payment is defined as mobile money, which is considered as an attractive alternative for cash, cheque, or credit.  In this paper we propose a new secure mobile payment method. This method is summarized in three processes: firstly, the authentication process, which involves the authentication phases for the applied customers. Secondly, the member recognition process which tests and ensures the customer membership by the market server. Finally, payment process which will be done by ciphering the customer information using public-key encryption cryptosystem (RSA), to be submitted over an insecure network to the market server. Actually, this mobile payment method is more efficient than other payment methods since the customer can pay from his/her own mobile phone without any extra cost and effort. The RSA public-key encryption system ensures the security of the proposed method. However, to prevent a brute force attack, the choice of the key size becomes crucial.

Integrated System For Monitoring And Recognizing Students During Class Session.

IJMA,

Cryptosystems Based on Chaos Theory.

 

 

Springer International Publishing- Switzerland-    Chaos, Complexity and Leadership 2013

Springer Proceedings in Complexity 2015, pp 129-145

http://link.springer.com/chapter/10.1007/978-3-319-09710-7_11

 

Abstract

 

This paper reviews some developments in cryptographic primitives based on chaotic systems; such as Mandelbrot set, Julia set, and logistic map. However we classified the reviewed chaotic cryptosystems into two categorizes; public- key and non public-key cryptosystems. Chaos system has attracted much attention in the field of cryptography due to its properties such as deterministic and sensitive to the initial values. As it will be indicated on the following sections, researchers are urgently looking for new public-key primitives (encryption, key sharing and digital signature) and non public-key system (Hash function) those might be able to replace standard cryptographic algorithms. In the surveyed non public-key system, we are showing  the  latest hash function(chaos Hash Algorithm 1 (CHA-1)) which is based on chaos theory. CHA-1 accepts message with length less than 280 bits and produces unique message digest of length 160-bit. As well as, in the public-key systems, the creation of the Fractal based public-key primitives is possible because of the intrinsic connection between the Mandelbrot and Julia Fractal sets. The surveyed chaotic cryptosystems are attractive alternative to the traditional number theory based cryptosystems.

Face Recognition System Based on Different Artificial Neural Networks Models and Training Algorithms.

IJACSA,

Solving transportation problems-using the best candidates method.

Computer Science & Engineering: An International Journal (CSEIJ).Vol.2, No.5.

Graphical Password Based On Standard Shapes.

Science Series Data Report Journal.

Contact

Please don’t hesitate to contact me for more information about my work.

Tel: +962-6-4291511
Fax: +962-6-4291432

No more, where are you going?

Go back to top or use the menu to your left to navigate.

Thanks for downloading!

Top