Parallel Implementation of RSA 2D-DCT Steganography and Chaotic 2D-DCT Steganography

TLDR: The parallelized version of chaotic steganography is proved to be an efficient algorithm for larger messages and to have reduced processing time than serial version with the speed-up ratios of 1.6 and 3.18.

Abstract: Information security has been one of the major concerns in the field of communication today. Steganography is one of the ways used for secure communication, where people cannot feel the existence of the secret information. The need for parallelizing an algorithm increases, as any good algorithm becomes a failure if the computation time taken by it is large. In this paper two parallel algorithms—parallel RSA (Rivest Shamir Adleman) cryptosystem with 2D-DCT (Discrete Cosine Transformation) steganography and parallel chaotic 2D-DCT steganography—have been proposed. The performance of both algorithms for larger images is determined and chaotic steganography is proved to be an efficient algorithm for larger messages. The parallelized version also proves to have reduced processing time than serial version with the speed-up ratios of 1.6 and 3.18.