Curriculum Vitae
Information
Name:
Dr.Shakir Mahmood Al-Faraji
Faculty:
Information Technology
Department:
Computer Information System
E-mail:
UOP Email:shussain@uop.edu.jo
Phone:
065715553
Extention:
302
Mobile:
Qualifications
Qualification
University
Country
Year
Ph.D
University of Technology
Iraq
1997
Masters
Oklahome State University
United States of America
1984
Publications
Title:
Threshold Secret Sharing Authentication Scheme in Noisy Mobile Ad Hoc
Networks
Type:
Presented Papers at Conferences
Date:
4/12/2009
This paper presents a description and performance evaluation of a threshold
secret sharing (TSS) authentication scheme for self-securing mobile ad hoc
networks (MANETs) suffering from high packet-loss and node mobility. In
order to evaluate the performance of the TSS scheme in a noisy MANET, a
number of simulations were carried-out. We concluded that presence of noise
inflicts significant reduction in the authentication success ratio (SR) and
consequently degrades the performance of the network, while node mobility
inflicts no or insignificant effects. The outcomes of these simulations are so
important to facilitate efficient network management.
Title:
A Non-Exchanged Password Scheme for Password-Based
Type:
Published Paper
Date:
12/1/2008
The password-based authentication is widely used in client-server systems.
This research presents a non-exchanged password scheme for password-based
authentication. This scheme constructs a Digital Signature (DS) that is derived
from the user password. The digital signature is then exchanged instead of the
password itself for the purpose of authentication. Therefore, we refer to it as a
Password-Based Digital Signature (PBDS) scheme. It consists of three phases,
in the first phase a
password-based Permutation (P) is computed using the Key-Based Random
Permutation (KBRP) method. The second phase utilizes P to derive a Key (K)
using the Password-Based Key Derivation
(PBKD) algorithm. The third phase uses P and K to generate the exchanged
DS. The scheme has a number of features that shows its advantages over other
password authentication approaches.
Title:
DES Enhancement Using Key-Based Randomized Initial Permutation
Type:
Presented Papers at Conferences
Date:
7/14/2008
This paper introduces a new method to enhance the performance of the
Standard Data Encryption Standard (DES), or any permutation dependent
encryption algorithms, by increasing the brute-force attack time complexity by
a factor of 64!. The new algorithm is referred to as Enhanced DES (EDES).
This is done by replacing the predefined initial permutations (IP) and its
inverse (IP-1) that are used in the standard DES design with key-based
permutations. The new permutations are derived using the Key-Based Random
Permutation (KBRP) method. These permutations are derived by using the
same cipher key that is used in the standard DES. Therefore, these
permutations will not be fixed and can be considered as pseudorandom
permutations. The performance of the new EDES algorithm is examined in
term of the features of the generated ciphertext and processing time.
Title:
A Password-Based Key Derivation Algorithm Using the KBRP Method
Type:
Published Paper
Date:
2/7/2008
This study presents a new efficient password-based strong key derivation
algorithm using the key based random permutation the KBRP method. The
algorithm consists of five steps, the first three steps are similar to those formed
the KBRP method. The last two steps are added to derive a key and to ensure
that the derived key has all the characteristics of a strong key. In order to
demonstrate the efficiency of the algorithm, a number of keys are derived using
various passwords of different content and length. The features of the derived
keys show a good agreement with all characteristics of strong keys. In addition,
they are compared with features of keys generated using the WLAN strong key
generator v2.2 by Warewolf La
Title:
An adaptive character wordlength algorithm for data compression
Type:
Published Paper
Date:
5/16/2007
This paper presents a new and efficient data compression algorithm, namely,
the adaptive character wordlength (ACW)
algorithm, which can be used as complementary algorithm to statistical
compression techniques. In such techniques, the characters in the source file
are converted to a binary code, where the most common characters in the file
have the shortest binary codes,
and the least common have the longest; the binary codes are generated based
on the estimated probability of the character within the file. Then, the binary
coded file is compressed using 8 bits character wordlength. In this new
algorithm, an optimum character
wordlength, b, is calculated, where b > 8, so that the compression ratio is
increased by a factor of b/8. In order to validate this algorithm, it is used as a
complement algorithm to Huffman code to compress a source file having 10
characters with different probabilities, and these characters are randomly
distributed within the source file. The results obtained and the factors that
affect the optimum value of b are discussed, and, finally, conclusions are
presented.
Title:
Key Based Random Permutation (KBRP)
Type:
Published Paper
Date:
6/1/2006
This study introduces a method for generating a particular permutation P of a
given size N out of N! permutations from a given key. This method computes a
unique permutation for a specific size since it takes the same key; therefore, the
same permutation can be computed each time the same key and size are
applied. The name of random permutation comes from the fact that the
probability of getting this permutation is 1 out of N! possible permutations.
Beside that, the permutation can not be guessed because of its generating
method that is depending completely on a given key and size.
Title:
The Use of User Response Time for Remote
Type:
Presented Papers at Conferences
Date:
6/1/2006
This paper presents a new password authentication method, which is, in
addition to depending on matching each password element, it also depends on
the time that a user takes (response time) for entering each password element.
The t-distribution test is used to examine the input time of each password
element with the time limits, which are stored in the system database, for that
particular password element. The test is carried out on each password element
and the password is accepted when the test is passed for all the password
elements or be set to accept some failure.
Experiance
1978-1981 Assistant system analyst National Computer center - Iraq
1983-1984 Teaching Assistant Oklahoma State University - USA
1984-1992 Senior system analyst National Computer Center - Iraq
1992-1997 Lecturer Al-Rafidain University College, Iraq
1997-2008 Assistant professor Applied Science University - Jordan
2008-present Assistant professor Petra University