Methaq Talib Gaata
Mustansiriyah University

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Bulletin of Electrical Engineering and Informatics

K-Means clustering-based semi-supervised for DDoS attacks classification Mahdi Nsaif Jasim; Methaq Talib Gaata
Bulletin of Electrical Engineering and Informatics Vol 11, No 6: December 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v11i6.4353

Abstract

Network attacks of the distributed denial of service (DDoS) form are used to disrupt server replies and services. It is popular because it is easy to set up and challenging to detect. We can identify DDoS attacks on network traffic in a variety of ways. However, the most effective methods for detecting and identifying a DDoS attack are machine learning approaches. This attack is considered to be among the most dangerous internet threats. In order for supervised machine learning algorithms to function, there needs to be tagged network traffic data sets. On the other hand, an unsupervised method uses network traffic analysis to find assaults. In this research, the K-Means clustering algorithm was developed as a semi-supervised approach for DDoS classification. The proposed algorithm is trained and tested with the CICIDS2017 dataset. After using the proposed hybrid feature selection methods and applying multiple training, testing, and carefully sorting DDoS traffic through a series of experiments, the optimum 2 centroids were found to be DDoS and normal. The generated centroids can be used to classify network traffic. So the proposed method succeeded to cluster the network traffic to safe and theat.
Development of playfair cryptosystem based on generation a multi-dimensional key matrix Mustafa Dhiaa Al-Hassani; Methaq Talib Gaata
Bulletin of Electrical Engineering and Informatics Vol 12, No 3: June 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v12i3.5052

Abstract

Playfair is considered as one of the classical encryption symmetric methods, it has a limitation of using just 5×5 matrix, which means only 25 English letters could be represented. In this work, a 2D and 3D method is adopted as an expanded matrix that encompass the overall American standard code for information interchange (ASCII) codes in a permuted manner for all symbols of any language. Any sort of the multi-dimensional matrix will enhance the security by increasing the complexity on the attacker to try 256! patterns of keys probabilities instead of 25!. The key-matrix is generated from the chaotic maps for some control parameters as patterns of non-repeating random numbers from 0 to 255 equivalent to their ASCII code values. The security of the proposed method not rely only on the number of key probabilities, but exceed that to: matrix dimensionality, encryption/decryption algorithms, initial chaotic parameters, and key-matrix values permutation. The efficiency of the proposed cryptosystem has been investigated when tested on 784 samples according to security measurements in which the obtained number of pixels change rate (NPCR) (99.609) is very close to the ideal value, while the correlation plotting close to zero (0.00058) and entropy near from 8 (7.9998).