Article Per Year (5 Year)
p-Index From 2021 - 2026
1.452
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering International Journal of Advances in Applied Sciences TELKOMNIKA (Telecommunication Computing Electronics and Control) Bulletin of Electrical Engineering and Informatics Indonesian Journal of Electrical Engineering and Computer Science Journal of Computing Theories and Applications
Mohamad Afendee Mohamed
Universiti Sultan Zainal Abidin
Computer Science & IT Decision Sciences, Operations Research & Management Earth & Planetary Sciences Electrical & Electronics Engineering Environmental Science Materials Science & Nanotechnology Mathematics Physics

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

Found 16 Documents
Search

 1   2 
An ant colony algorithm for universiti sultan zainal abidin examination timetabling problem Ahmad Firdaus Khair; Mokhairi Makhtar; Munirah Mazlan; Mohamad Afendee Mohamed; Mohd Nordin Abdul Rahman
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 1: January 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i1.pp191-198

Abstract

The real-life construction of examination timetabling problem is considered as a common problem that always encountered and experienced in educational institution whether in school, college, and university. This problem is usually experienced by the academic management department where they have trouble to handle complexity for assign examination into a suitable timeslot manually. In this paper, an algorithm approach of ant colony optimisation (ACO) is presented to find an effective solution for dealing with Universiti Sultan Zainal Abidin (UniSZA) examination timetabling problems. A combination of heuristic with ACO algorithm contributes the development solution in order to simplify and optimize the pheromone occurrence of matrix updates which include the constraints problem. The implementation of real dataset instances from academic management is applied to the approach for generating the result of examination timetable. The result and performance that obtained will be used for further use to evaluate the quality and observe the solution whether our examination timetabling system is reliable and efficient than the manual management that can deal the constraints problem.
An Efficient Schema of a Special Permutation Inside of Each Pixel of an Image for its Encryption Hana Ali-Pacha; Naima Hadj-Said; Adda Ali-Pacha; Mustafa Mamat; Mohamad Afendee Mohamed
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 2: August 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v11.i2.pp496-503

Abstract

The developments of communications and digital transmissions have pushed the data encryption to grow quickly to protect the information, against any hacking or digital plagiarisms. Many encryption algorithms are available on the Internet, but it's still illegal to use a number of them. Therefore, the search for new the encryption algorithms is still current. In this work, we will provide a preprocessing of the securisation of the data, which will significantly enhance the crypto-systems. Firstly, we divide the pixel into two blocks of 4 bits, a left block that contains the most significant bit and another a right block which contains the least significant bits and to permute them mutually. Then make another permutation for each of group. This pretreatment is very effective, it is fast and is easy to implement and, only consumes little resource.
Cloud data security and various cryptographic algorithms Yahia Alemami; Ali M. Al-Ghonmein; Khaldun G. Al-Moghrabi; Mohamad Afendee Mohamed
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 2: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i2.pp1867-1879

Abstract

Cloud computing has spread widely among different organizations due to its advantages, such as cost reduction, resource pooling, broad network access, and ease of administration. It increases the abilities of physical resources by optimizing shared use. Clients’ valuable items (data and applications) are moved outside of regulatory supervision in a shared environment where many clients are grouped together. However, this process poses security concerns, such as sensitive information theft and personally identifiable data leakage. Many researchers have contributed to reducing the problem of data security in cloud computing by developing a variety of technologies to secure cloud data, including encryption. In this study, a set of encryption algorithms (advance encryption standard (AES), data encryption standard (DES), Blowfish, Rivest-Shamir-Adleman (RSA) encryption, and international data encryption algorithm (IDEA) was compared in terms of security, data encipherment capacity, memory usage, and encipherment time to determine the optimal algorithm for securing cloud information from hackers. Results show that RSA and IDEA are less secure than AES, Blowfish, and DES). The AES algorithm encrypts a huge amount of data, takes the least encipherment time, and is faster than other algorithms, and the Blowfish algorithm requires the least amount of memory space.
Advanced approach for encryption using advanced encryption standard with chaotic map Yahia Alemami; Mohamad Afendee Mohamed; Saleh Atiewi
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 2: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i2.pp1708-1723

Abstract

At present, security is significant for individuals and organizations. All information need security to prevent theft, leakage, alteration. Security must be guaranteed by applying some or combining cryptography algorithms to the information. Encipherment is the method that changes plaintext to a secure form called cipherment. Encipherment includes diverse types, such as symmetric and asymmetric encipherment. This study proposes an improved version of the advanced encryption standard (AES) algorithm called optimized advanced encryption standard (OAES). The OAES algorithm utilizes sine map and random number to generate a new key to enhance the complexity of the generated key. Thereafter, multiplication operation was performed on the original text, thereby creating a random matrix (4×4) before the five stages of the coding cycles. A random substitution-box (S-Box) was utilized instead of a fixed S-Box. Finally, we utilized the eXclusive OR (XOR) operation with digit 255, also with the key that was generated last. This research compared the features of the AES and OAES algorithms, particularly the extent of complexity, key size, and number of rounds. The OAES algorithm can enhance complexity of encryption and decryption by using random values, random S-Box, and chaotic maps, thereby resulting in difficulty guessing the original text.
Addition chain heuristics in application to elliptic curve cryptosystems Mohamad Afendee Mohamed; Yahaya Garba Shawai; Mohd Noor Derahman; Abd Rasid Mamat; Siti Dhalila Mohd Satar; Ahmad Faisal Amri Abidin; Mohd Fadzil Abdul Kadir
International Journal of Advances in Applied Sciences Vol 13, No 3: September 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijaas.v13.i3.pp546-555

Abstract

The idea of an addition chain can be applied to scalar multiplication involving huge number operations in elliptic curve cryptosystems. In this article, initially, we study the taxonomy of the addition chain problem to build up an understanding of the problem. We then examine the mathematics behind an optimal addition chain that includes the theoretical boundary for the upper limit and lower limit which laid the foundation for experimentation hereafter. In the following, we examine different addition chain solutions that were used to increase efficiency in scalar multiplication. To avoid any possible confusion, we intentionally separated the discussion into two modules called integer recoding method and chain generator based on the heuristics method. These methods were developed by considering various aspects such as the space within which the operation is executed, the curve that is selected, the formulation to express the original equation, and the choices of operation and arithmetic, all together to improve operational efficiency.
Understanding Statistical and Temporal Representations for Large-Scale IoT DDoS Detection Through Ablation-Driven Analysis Daniel Nomolas Wicaksono; De Rosal Ignatius Moses Setiadi; Ajib Susanto; Imanuel Harkespan; Mohamad Afendee Mohamed; Aceng Sambas
Journal of Computing Theories and Applications Vol. 3 No. 4 (2026): JCTA 3(4) 2026
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.16126

Abstract

Recent Internet of Things (IoT) intrusion detection studies have reported near-perfect benchmark performance for Distributed Denial of Service (DDoS) detection, yet limited attention has been given to understanding how different traffic representations contribute to the detection process under highly imbalanced traffic conditions. This study presents an ablation-driven analysis to investigate the contribution of statistical and temporal representations for large-scale IoT DDoS detection using the CICIoT2023 dataset. Three experimental scenarios are evaluated, including statistical representation, temporal sequence representation, and hybrid statistical–temporal representation. Temporal representations are learned using a one-dimensional Convolutional Neural Network (1D-CNN) with lag-based traffic sequences, while ensemble tree-based classifiers are employed for final classification and representation analysis. In addition, multiple ablation configurations are designed to evaluate the impact of temporal dependency modeling and feature engineering strategies on detection performance. Experimental results show that statistical traffic representations remain highly effective for DDoS detection on CICIoT2023, achieving 99.36% accuracy and 99.31% weighted F1-score in the statistical representation scenario. Feature importance analysis further indicates that engineered statistical features contribute substantially more to the classification process than CNN-based temporal representations. Although temporal modeling captures sequential traffic behavior, its contribution is relatively limited and mainly acts as a complementary representation. Furthermore, the hybrid configuration produces only marginal improvements over the statistical representation alone. These findings highlight the importance of representation-level analysis for understanding the actual contribution of statistical and temporal modeling in modern IoT intrusion detection systems beyond relying solely on benchmark accuracy.
Co-Authors Abd Rasid Mamat Aceng Sambas Aceng Sambas Adda Ali-Pacha Adda Ali-Pacha Ahmad Faisal Amri Abidin Ahmad Firdaus Khair Ahmad Firdaus Khair Ahmad Khairi Ajib Susanto Ali M. Al-Ghonmein Asari Djohar Ayman Ali Arafa Babatunde Idowu Chen Soong Der Chimeleze Collins Uchenna Daniel Nomolas Wicaksono Darmawan Setia Rahayu De Rosal Ignatius Moses Setiadi Gamal M Mahmoud Hana Ali-Pacha Hana Ali-Pacha Imanuel Harkespan Irene M. Moroz Ismail Taha Ahmed Khaldun G. Al-Moghrabi Lam Kwok Yan Mada Sanjaya WS Mohd Fadzil Abdul Kadir Mohd Noor Derahman Mohd Nordin Abdul Rahman Mokhairi Makhtar Mujiarto Mumu Komaro Munirah Mazlan Mustafa Mamat Naima Hadj-Said Naima Hadj-Said Nazirah Abdul Hamid Norziana Jamil Roslan Ismail Saleh Atiewi Saleh Atiewi Sen Zhang Siti Dhalila Mohd Satar Subiyanto Subiyanto Sundarapandian Vaidyanathan Sundarapandian Vaidyanathan Yahaya Garba Shawai Yahia Alemami Yahia Alemami Yicheng Zeng