فهرس المقالات Saeid Taghavi Afshord


  • المقاله

    1 - Presenting an Imperceptible Steganographic Algorithm through Genetic Algorithm and Mix Column Transform
    Journal of Advances in Computer Research , العدد 4 , السنة 8 , تابستان 2017
    Due to growth and development of data communications, the need for fast and secure transmission of information is very important. In order to address this problem, especially over the internet, some of the security systems such as cryptography and steganography can be u أکثر
    Due to growth and development of data communications, the need for fast and secure transmission of information is very important. In order to address this problem, especially over the internet, some of the security systems such as cryptography and steganography can be used. Steganography is a way for secure and confidential communication. In this paper, an algorithm for color image steganography through mix column transform and the genetic algorithm is presented, which is a distinct type of the transform. The proposed method divides the image into blocks and the mix column transform of each block is obtained. Then, the genetic algorithm is applied to determine the best permutation for inserting the secret message. By using the genetic algorithm, bits of the message is embedded in the least significant bits of the image. Experimental results show that, not only the visual quality of the stego image is improved, but also the embedding time of the image and the capacity are increased. تفاصيل المقالة

  • المقاله

    2 - Analyzing Decompositions of a System of Boolean Functions Using the Ternary Matrix Cover Approach
    Journal of Advances in Computer Research , العدد 2 , السنة 4 , بهار 2013
    The problem of series two-block disjoint decomposition of completely specified Boolean functions is considered. Analysis and investigation of such systems are very important in logical design context. Recently, a good method for solving this problem was suggested which أکثر
    The problem of series two-block disjoint decomposition of completely specified Boolean functions is considered. Analysis and investigation of such systems are very important in logical design context. Recently, a good method for solving this problem was suggested which has been based on the ternary matrix cover approach. Using this method a computer program was developed. This paper is focused on decomposability of a system of Boolean functions. The experiments were done on generated systems and standard benchmarks. In decomposable systems, the total number of solutions and the time elapsed to achieve them are inspected. The total number of solutions among all partitions for investigated systems, ranged between 3% and 87% in generated systems and also, 1% and 96% in standard benchmarks. تفاصيل المقالة