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

HM Al-Dabbas, RA Azeez, AE Ali, IRAQI JOURNAL OF COMPUTERS, COMMUNICATIONS, CONTROL AND SYSTEMS ENGINEERING, 2023

In recent years, Elliptic Curve Cryptography (ECC) has attracted the attention of
researchers and product developers due to its robust mathematical structure and
highest security compared to other existing algorithms like RSA. It is found to give
an increased security compared to RSA for the same key-size or same security as
RSA with less key size. In this paper a new approach is proposed for encrypting
digital image using the arithmetic of elliptic curve algebra. The proposed approach
produced a new mask for encrypt the digital image by use a new convolution
processes based on ECC algebra operations and work as symmetric cryptographic
system instead of asymmetric system. A new approach combined both compression

     Image content verification is to confirm the validity of the images, i.e. . To test if the image has experienced any alteration since it was made. Computerized watermarking has turned into a promising procedure for image content verification in light of its exceptional execution and capacity of altering identification.

     In this study, a new scheme for image verification reliant on two dimensional chaotic maps and Discrete Wavelet Transform (DWT) is introduced. Arnold transforms is first applied to Host image (H) for scrambling as a pretreatment stage, then the scrambled host image is partitioned into sub-blocks of size 2×2 in which a 2D DWT is utilized on  ea

􀀨􀀅􀀆􀀔􀀜􀀄􀀂􀀆􀀈􀀓􀀌􀀩􀀏􀀆􀀉􀀅􀀆􀀉􀀅􀀉􀀚􀀝􀀔􀀄􀀗􀀉􀀚􀀆􀀂􀀓􀀚􀀁􀀔􀀄􀀓􀀅􀀆􀀄􀀂􀀆􀀔􀀓􀀆􀀃􀀂􀀔􀀄􀀟􀀉􀀔􀀃􀀆􀀔􀀜􀀃􀀆􀀛􀀃􀀜􀀄􀀗􀀚􀀃􀀆􀀗􀀌􀀄􀀔􀀄􀀗􀀉􀀚􀀆􀀂􀀘􀀃􀀃􀀊􀀂􀀆􀀓􀀖􀀆􀀓􀀛􀀃􀀌􀀔􀀁􀀌􀀅􀀄􀀅􀀕􀀢􀀆􀀪􀀜􀀃􀀆􀀄􀀅􀀛􀀃􀀂􀀔􀀄􀀕􀀉􀀔􀀄􀀓􀀅􀀂􀀆 􀀉􀀌􀀃􀀆􀀙􀀉􀀂􀀃􀀊􀀆􀀓􀀅􀀆􀀉􀀁􀀔􀀓􀀟􀀓􀀙􀀄􀀚􀀃􀀆􀀚􀀉􀀔􀀃􀀌􀀉􀀚􀀆􀀂􀀘􀀉􀀗􀀃􀀆􀀟􀀄􀀊􀀂􀀔􀀆􀀔􀀜􀀃􀀆􀀗􀀃􀀅􀀔􀀃􀀌􀀚􀀄􀀅􀀃􀀂􀀆􀀓􀀖􀀆􀀔􀀜􀀃􀀆􀀙􀀉􀀂􀀃􀀆

Estimating the semantic similarity between short texts plays an increasingly prominent role in many fields related to text mining and natural language processing applications, especially with the large increase in the volume of textual data that is produced daily. Traditional approaches for calculating the degree of similarity between two texts, based on the words they share, do not perform well with short texts because two similar texts may be written in different terms by employing synonyms. As a result, short texts should be semantically compared. In this paper, a semantic similarity measurement method between texts is presented which combines knowledge-based and corpus-based semantic information to build a semantic network that repre

The use of online social network (OSN) has become essential to humans' lives whether for entertainment, business or shopping. This increasing use of OSN motivates designing and implementing special systems that use OSN users' data to provide better user experience using machine learning and data mining algorithms and techniques. One system that is used extensively for this purpose is friend recommendation system (FRS) in which it recommends users to other users in professional or entertaining online social networks.

For this purpose, this study proposes a novel friend recommendation system, namely Hybrid Friend Recommendation (FR) model. The Hybrid model applies dual-stage methodology on unlabeled data of 1241 users collected fro

The definition of orthogonal generalized higher k-derivation is examined in this paper and we introduced some of its related results.

In this paper, a robust invisible watermarking system for digital video encoded by MPEG-4 is presented. The proposed scheme provides watermark hidden by embedding a secret message (watermark) in the sprite area allocated in reference frame (I-frame). The proposed system consists of two main units: (i) Embedding unit and (ii) Extraction unit. In the embedding unit, the system allocates the sprite blocks using motion compensation information. The allocated sprite area in each I–frame is used as hosting area for embedding watermark data. In the extraction unit, the system extracts the watermark data in order to check authentication and ownership of the video. The watermark data embedding method is Blocks average modulation applied on RGB dom