In our normal life, we sometimes need a process of replacing something with another to get out of the stereotype. From this point of view, Mahmood’s attempted in the year 2020 to replace the content in the first main e-abacus diagram. He found the general rule for finding the value of the new partition after the replacement from the original partition. Here we raise the question: Can we find the appropriate mechanisms for the remainder of the main e-abacus diagram?

     We will provide a new method in this study that integrates two types of applications, namely Graph Theory and Conjugate Young Diagram, the idea of combining the graph and the Young diagram is presented by Ali And Mahmood, which is primarily based on the idea of the e-abacus diagram, the new method is called GCYD, it directly applies to the English letter section, which will be a two-layer coding. It makes it difficult to detect the word or sentence.

In the partition theory, there is more then one form of representation of dedication, most notably the Abacus diagram, which gives an accurate and specific description. In the year 2019, Mahmood and Mahmood presented the idea of merging more than two plans, and then the following question was raised: Is the process of separating any somewhat large diagram into smaller schemes possible? The general formula to split e-abacus diagram into two or more equal or unequal parts was achieved in this study now.

In any security system, we need a high level of security, to maintain the secrecy of important data. Steganography is one of the security systems that are hiding secret information within a certain cover (video, image, sound, text), so that the adversary does not suspect the existence of such confidential information. In our proposed work will hide secret messages (Arabic or English) text in the Arabic cover text, we employed the RNA as a tool for encoding the secret information and used non-printed characters to hide these codes. Each character (English or Arabic) is represented by using only six bits based on secret tables this operation has provided a good compression since each Arabic character needs 16 bits and each English characte

Exchange of information through the channels of communication can be unsafe. Communication media are not safe to send sensitive information so it is necessary to provide the protection of information from disclosure to unauthorized persons. This research presented the method to information security is done through information hiding into the cover image using a least significant bit (LSB) technique, where a text file is encrypted using a secret sharing scheme. Then, generating positions to hiding information in a random manner of cover image, which is difficult to predict hiding in the image-by-image analysis or statistical analyzes. Where it provides two levels of information security through encryption of a text file using the secret sha

Steganography is one of the most popular techniques for data hiding in the different media such as images, audio or video files. This paper introduced the improved technique to hide the secret message using the LSB algorithm inside the RGB true color image by encrypting it using the secret key transformation function. The key is selecting randomly in the GF (2n) with condition it has an inverse value to retrieve the encrypted message. Only two bits are used for the low byte in each pixel (the blue byte) to hide the secret message, since the blue color has a weak effect on human eyes. The message hidden by the suggested algorithm is less vulnerable to be stolen than other similar applications.

This paper focuses on developing a strategy to represent the -connected ominoes using an abacus. We use the idea of -connected ominoes with respect to a frame in modelling nested chain abacus. Then, we formulate and prove the unique connected partition for any -connected ominoes. Next, the topological structure of nested chain abacus is presented.