RARasha Subhi Ali

Rasha Subhi Ali

*This is an algorithmically generated author record based on publicly available information.

Rasha Subhi Ali has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Proposal for encryption by using modified play fair algorithm and bioinformatics techniques

    by Rasha S. Ali, Rajaa Kadhom Hassoun, Inas Fadhil Jaleel, Noor Subhi Ali


  • Open Access

    Security Protocol of Keys Management System for Transmission Encrypted Data

    by Rasha Subhi Ali, Alaa Kadhim F.

    One of the essential obstacles for the deployment of multicast is the lack of protection. And in multicast security, key management for securing organization or group communication is an important area that desires to be addressed. This paper will give an overview of four key management methods and Kerberos protocol. Cryptographic methods are frequently used for secure Data transmission wireless networks. Most cryptographic approaches can be symmetric and asymmetric, depending on the manner of the utilized keys. There are many kinds of key management methods which have been suggested for secure data transmission. This research includes a study of different key management methods to find an efficient key management for Secure and Reliable data transmission in the network. The experimental results showed that the fourth method represents the optimal key management method because it was providing a more secure way for the transmitted data, and the total time for data retrieval was (314.065, 376.119, 590.348, and 474.881) for the four key management methods sequentially to retrieve 71923records. The first three key management methods depend on symmetric key cryptography and the fourth key management method is a hybrid method, it was dependent on symmetric and asymmetric key cryptography, symmetric in the case of using user shared key and asymmetric in case of using server private key and this was unknown for any one.


  • Enhancement CAST block algorithm to encrypt big data

    by F. Alaa Kadhim, Ghassan H. Abdul-Majeed, Rasha Subhi Ali

    In this research the security issues are discussed for securing big data. Encryption algorithms play an essential part to secure information. This paper demonstrates analysis of well-known block cipher CAST-256 and its modified version using modified S-Box and key generator. In this research the implementation of the modified CAST cryptography algorithm was discussed. It was worked dynamically on big data by utilizing the generated keys and compression algorithm to reduce the execution time. In the detail of security analysis and experimental results of the suggested encryption algorithm is rapidly and alternatively it supplied just right protection and added most likely much less overhead at the data, this in these days is probably the most necessities required for big data. The main idea of this research included in how to modify the CAST encryption algorithm by making it work in a dynamic way, make it dependent on DNA computing and using one S-Box instead of 6 S-Boxes.


  • Proposal new s-box depending on DNA computing and mathematical operations

    by F. Alaa Kadhim, Ghassan H. Abdul Majeed, Rasha Subhi Ali

    Today, information has become an important resource and so is its security. Many scientists attempted to use new methods inspired from DNA bio-techniques in the field of cryptography and steganography. The idea of using DNA cryptography has been specified as possible technology that gets a new hope for unbreakable algorithms as traditional cryptographic systems are now vulnerable to certain attacks. S-boxes (Substitution boxes) are keystones of modern symmetric cryptosystems (block ciphers and stream ciphers). In this research a new s-box creation scheme was proposed based on encoding into DNA codon, XOR operation and some mathematical operations. The results of the tests showed that the proposed method was effectively passed the S-Box tests criteria of such as balanced, completeness, avalanche criterion and strict avalanche criterion. The results showed that the proposed method provides secure S-box, which is 255 differences was found when changing only 1 bit of key, thus approximately %99 the S-Box was changed. In this method the secret key and the server name are used as example for generating new values of S-box two keys was used to strengthen the security of the created S-Box. Also, one key can be used to generate the S-Box values because of another key was generated by using the proposed method and it is equal to 0. The s-box inverse was also generated depending on the same strings that are used in generating the s-box. The generation time measured in milliseconds. The proposed method does not include several stages such as genetic algorithms. So the proposed method faster than genetic algorithms to the fact that genetic algorithm passed through several stages to find the best solution.