Cryptography is a major concern in communication systems. IoE technology is a new trend of smart systems based on various constrained devices. Lightweight cryptographic algorithms are mainly solved the most security concern of constrained devices and IoE systems. On the other hand, most lightweight algorithms are suffering from the trade-off between complexity and performance. Moreover, the strength of the cryptosystems, including the speed of the algorithm and the complexity of the system against the cryptanalysis. A chaotic system is based on nonlinear dynamic equations that are sensitive to initial conditions and produce high randomness which is a good choice for cryptosystems. In this work, we proposed a new five-dimensional of a chaoti

To achieve safe security to transfer data from the sender to receiver, cryptography is one way that is used for such purposes. However, to increase the level of data security, DNA as a new term was introduced to cryptography. The DNA can be easily used to store and transfer the data, and it becomes an effective procedure for such aims and used to implement the computation. A new cryptography system is proposed, consisting of two phases: the encryption phase and the decryption phase. The encryption phase includes six steps, starting by converting plaintext to their equivalent ASCII values and converting them to binary values. After that, the binary values are converted to DNA characters and then converted to their equivalent complementary DN

<p>In this paper, a simple color image compression system has been proposed using image signal decomposition. Where, the RGB image color band is converted to the less correlated YUV color model and the pixel value (magnitude) in each band is decomposed into 2-values; most and least significant. According to the importance of the most significant value (MSV) that influenced by any simply modification happened, an adaptive lossless image compression system is proposed using bit plane (BP) slicing, delta pulse code modulation (Delta PCM), adaptive quadtree (QT) partitioning followed by an adaptive shift encoder. On the other hand, a lossy compression system is introduced to handle the least significant value (LSV), it is based on

Intrusion detection systems detect attacks inside computers and networks, where the detection of the attacks must be in fast time and high rate. Various methods proposed achieved high detection rate, this was done either by improving the algorithm or hybridizing with another algorithm. However, they are suffering from the time, especially after the improvement of the algorithm and dealing with large traffic data. On the other hand, past researches have been successfully applied to the DNA sequences detection approaches for intrusion detection system; the achieved detection rate results were very low, on other hand, the processing time was fast. Also, feature selection used to reduce the computation and complexity lead to speed up the system

Hiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.

Biometrics is widely used with security systems nowadays; each biometric modality can be useful and has distinctive properties that provide uniqueness and ambiguity for security systems especially in communication and network technologies. This paper is about using biometric features of fingerprint, which is called (minutiae) to cipher a text message and ensure safe arrival of data at receiver end. The classical cryptosystems (Caesar, Vigenère, etc.) became obsolete methods for encryption because of the high-performance machines which focusing on repetition of the key in their attacks to break the cipher. Several Researchers of cryptography give efforts to modify and develop Vigenère cipher by enhancing its weaknesses.

This research deals with one scene from the movie Romeo and Juliet, which is the balcony scene, due to the importance of this scene in the formation of the construction of the subsequent events of the movie.

The first chapter contained the methodological framework of the research, where the research problem was identified in how Zeffirelli dealt with the balcony scene in the play Romeo and Juliet and enriched it in the cinematic language with a comparison with the original text of the scene. In the balcony scene with comparative parts between the film and the text and the limits of the research that was limited to the film Zeffirelli and the translated text by Munis Taha Hussein.

The second chapter contained the theoretic

This paper deals with the subject of demarcating as appropriate scientific techniques to rationalize consumption and to control segments of the society for the technical conduct of its handling of the product depending on the mix of elements (product and the volume of demand, Price, promotion and distribution), but inverse manner designed to adjust the working condition of balance between supply and demand and to ensure that rates continue in the marketing process properly, and therefore the research aims to shed light on some of the practices that reflect the Demarketing techniques, As well as the statement of the reality of attitudes towards the practice of those techniques through a sample survey of officials in Baghdad company for so

 The current paper studied the concept of right n-derivation satisfying certified conditions on semigroup ideals of near-rings and some related properties. Interesting results have been reached, the most prominent of which are the following: Let M be a 3-prime left near-ring and A_1,A_2,…,A_n are nonzero semigroup ideals of M, if d is a right n-derivation of M satisfies on of the following conditions,
d(u_1,u_2,…,(u_j,v_j ),…,u_n )=0 ∀ 〖 u〗_1 〖ϵA〗_1 ,u_2 〖ϵA〗_2,…,u_j,v_j ϵ A_j,…,〖u_n ϵA〗_u;
d((u_1,v_1 ),(u_2,v_2 ),…,(u_j,v_j ),…,(u_n,v_n ))=0 ∀u_1,v_1 〖ϵA〗_1,u_2,v_2 〖ϵA〗_2,…,u_j,v_j ϵ A_j,…,〖u_n,v_n ϵA〗_u ;
d((u_1,v_1 ),(u_2,v_2 ),…,(u_j,v_j ),…,(u_n,v_n ))=(u_