Abstract-Security is the major concern when the sensitive information is stored and transferred across the internet where the information is no longer protected by physical boundaries. Cryptography is an essential, effective and efficient component to ensure the secure communication between the different entities by transferring unintelligible information and only the authorized recipient can be able to access the information. The right selection of cryptographic algorithm is important for secure communication that provides more security, accuracy and efficiency. In this paper, we examine the security aspects and processes involved in the design and implementation of most widely used symmetric encryption algorithms such as Data Encryption Standard (DES), Triple Data Encryption Standard (3DES), Blowfish, Advanced Encryption Standard (AES) and Hybrid Cubes Encryption Algorithm (HiSea). Furthermore, this paper evaluated and compared the performance of these encryption algorithms based on encryption and decryption time, throughput, key size, avalanche effect, memory, correlation assessment and entropy. Thus, amongst the existing cryptographic algorithm, we choose a suitable encryption algorithm based on different parameters that are best fit to the user requirements.

No abstract

Due to the tremendous development in the field of computer and software sciences, the theory of graphics has spread widely and quickly, even becoming one of the most important sciences that played a large role in solving many problems of many diverse applications. These applications include computer protocols, Google Maps, games and more. Many researches have discussed shortest path algorithms to solve the shortest path problem in these applications. In this study, a very popular algorithms called Dijkstra algorithm and Bellman-Ford algorithm are used to make a comparison between them on the basis of complexity and performance in terms of shortest path optimization. Our results show that Dijkstra is better than the Bellman-Ford interms of execution time and more efficient for solving the shortest path issue, but the algorithm of Dijkstra work with non-negative edge weights.

Software test cases can be defined as a set of condition where a tester needs to test and determine that the System Under Test (SUT) satisfied with the expected result correctly. This paper discusses the optimization technique in generating cases automatically by using EpiT (Eclipse Plug-in Tool). EpiT is developed to optimize the generation of test cases from source code in order to reduce time used for conventional manually creating test cases. By using code smell functionality, EpiT helps to generate test cases automatically from Java programs by checking its line of code (LOC). The implementation of EpiT will also be presented based on several case studies conducted to show the optimization of the test cases generated. Based on the results presented, EpiT is proven to solve the problem for software tester to generate test case manually and check the optimization from the source code using code smell technique.

No abstract

No abstract

Abstract-With the prominent needs for security and reliable mode of identification in biometric system. Iris recognition has become reliable method for personal identification nowadays. The system has been used for years in many commercial and government applications that allow access control in places such as office, laboratory, armoury, automated teller machines (ATMs), and border control in airport. The aim of the paper is to review iris recognition algorithms. Iris recognition system consists of four main stages which are segmentation, normalization, feature extraction and matching. Based on the findings, the Hough transform, rubber sheet model, wavelet, Gabor filter, and hamming distance are the most common used algorithms in iris recognition stages. This shows that, the algorithms have the potential and capability to enhanced iris recognition system.

No abstract