<p>Generally, The sending process of secret information via the transmission channel or any carrier medium is not secured. For this reason, the techniques of information hiding are needed. Therefore, steganography must take place before transmission. To embed a secret message at optimal positions of the cover image under spatial domain, using the developed particle swarm optimization algorithm (Dev.-PSO) to do that purpose in this paper based on Least Significant Bits (LSB) using LSB substitution. The main aim of (Dev. -PSO) algorithm is determining an optimal paths to reach a required goals in the specified search space based on disposal of them, using (Dev.-PSO) algorithm produces the paths of a required goals with most effi

Computer systems and networks are being used in almost every aspect of our daily life, the security threats to computers and networks have increased significantly. Usually, password-based user authentication is used to authenticate the legitimate user. However, this method has many gaps such as password sharing, brute force attack, dictionary attack and guessing. Keystroke dynamics is one of the famous and inexpensive behavioral biometric technologies, which authenticate a user based on the analysis of his/her typing rhythm. In this way, intrusion becomes more difficult because the password as well as the typing speed must match with the correct keystroke patterns. This thesis considers static keystroke dynamics as a transparent layer of t

   This paper proposed to build an authentication system between business partners on e-commerce application to prevent the frauds operations based on visual cryptography shares encapsulated by chen’s hyperchaotic key sequence. The proposed system consist of three phases, the first phase based on the color visual cryptography without complex computations, the second phase included generate sequence of DNA rules numbers and finally encapsulation phase is implemented based on use the unique initial value that generate in second phase as initial condition with Piecewise Linear Chaotic Maps to generate sequences of DNA rules numbers. The experimental results demonstrate the proposed able to overcome on cheating a

The Non-Photorealistic Rendering (NPR) demands are increased with the development of electronic devices. This paper presents a new model for a cartooning system, as an essential category of the NPR. It is used the concept of vector quantization and Logarithmic Image Processing (LIP). An enhancement of Kekre Median Codebook Generation (KMCG) algorithm has been proposed and used by the system. Several metrics utilized to evaluate the time and quality of the system. The results showed that the proposed system reduced the time of cartoon production. Additionally, it enhanced the quality of several aspects like smoothing, color reduction, and brightness.

   Hiding secret information in the image is a challenging and painstaking task in computer security and steganography system. Certainly, the absolute intricacy of attacks to security system makes it more attractive.in this research on steganography system involving information hiding,Huffman codding used to compress the secret code before embedding which provide high capacity and some security. Fibonacci decomposition used to represent the pixels in the cover image, which increase the robustness of the system. One byte used for mapping all the pixels properties. This makes the PSNR of the system higher due to random distribution of embedded bits. Finally, three kinds of evaluation are applied such as PSNR, chi-square attack, a

Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o