Omar A. Dawood

Work place: College of Education for Humanities Science, English Department, Anbar University and Ph.D. student at Computer Science Department, University of Technology, Baghdad, Iraq

E-mail: The_lionofclub@yahoo.com

Website:

Research Interests: Computer Architecture and Organization, Network Architecture, Network Security, Coding Theory, Data Structures and Algorithms

Biography

Omar Abdulrahman Dawood was born in Habanyah, Anbar, Iraq (1986), now he lives in Ramadi, Anbar. He obtained B.Sc. (2008), M.Sc. (2011) in Computer Science from the College of Computer, Anbar University, Iraq. He was ranking the first during his B.Sc. and M.Sc. studies. He is a teaching staff member in the English Department in College of Education for Humanities, Anbar University, and currently he is a Ph.D. student at the Technology University- Baghdad. His research interests are: Data and Network Security, Coding, Number Theory and Cryptography.

Author Articles
Generalized Method for Constructing Magic Cube by Folded Magic Squares

By Omar A. Dawood Abdul Monem S. Rahma Abdul Mohssen J. Abdul Hossen

DOI: https://doi.org/10.5815/ijisa.2016.01.01, Pub. Date: 8 Jan. 2016

In the present paper we have developed a new method for constructing magic cube by using the folded magic square technique. The proposed method considers a new step towards the magic cube construction that applied a good insight and provides an easy generalized technique. This method generalized the design of magic cube with N order regardless the type of magic square whether odd order, singly even order or doubly even order. The proposed method is fairly easy, since it have depended mainly on the magic square construction methods, and all what the designer need is just how to builds six magic square sequentially or with constant difference value between each pair of the numbers in the square matrix, whereby each one of this magic square will represents the surface or dimension for magic cube configuration. The next step for the designer will be how to arrange each square in the proper order to constitute the regular cube in order to maintain the properties of magic cube, where the sum of rows, columns and the diagonals from all directions are the same.

[...] Read more.
The New Block Cipher Design (Tigris Cipher)

By Omar A. Dawood Abdul Monem S. Rahma Abdul Mohsen J. Abdul Hossen

DOI: https://doi.org/10.5815/ijcnis.2015.12.02, Pub. Date: 8 Nov. 2015

In the present paper we have proposed a new variant of AES cipher with high level of security and an elegant construction called TIGRIS cipher. The TIGRIS name has been derived from one of the two famous rivers in Iraq. The proposed TIGRIS cipher is a revision for the proposed Euphrates cipher which has already been published. It has been designed with a good coherent structure that is based on solid algebraic and well mathematical opinions. The proposed cipher uses the SPN structure and what is known by the Galois Field GF (28). It is an iterated cipher that has a conservative design which is easily implemented on both hardware and software. It operates with block size of 128-bits and with three variable key lengths of 128-bits, 192-bits and 256-bits in addition to sixteen rounds or multiples of four rounds. The proposed cipher works with good invertible operations’ stages and a compact duplicated ciphering key. The Tigris cipher construction strategy includes the adoption of construction a new S-box with high non-linearity that uses the same routines of the AES-S-box stage but with different modular arithmetic of irreducible polynomial and different affine matrix in addition to the distinct constant vector. The second and the third layers of the proposed model are based on the shifting concept for the confusion and diffusion process with reversible operations. The last layer of the proposed model is the key addition layer that is responsible for the expanding and generating the ciphering key by two directions those of row and column expansion, which are associated with two constant vectors of golden ratio and base nature algorithm as a fixed word to eliminate any weak or semi-weak ciphering key.

[...] Read more.
Other Articles