A New Approach to Steganography using Sinc-Convolution Method

Both image steganography and image encryption have advantages and disadvantages. Steganograhy allows us to hide a desired image containing confidential information in a covered or host image while image encryption is decomposing the desired image to a non-readable, non-comprehended manner. The encryption methods are usually much more robust than the steganographic ones. However, they have a high visibility and would provoke the attackers easily since it usually is obvious from an encrypted image that something is hidden! The combination of steganography and encryption will cover both of their weaknesses and therefore, it increases the security. In this paper an image encryption method based on sinc-convolution along with using an encryption key of 128 bit length is introduced. Then, the encrypted image is covered by a host image using a modified version of JSteg steganography algorithm. This method could be applied to almost all image formats including TIF, BMP, GIF and JPEG. The experiment results show that our method is able to hide a desired image with high security and low visibility.

Solution of First kind Fredholm Integral Equation by Sinc Function

Sinc-collocation scheme is one of the new techniques used in solving numerical problems involving integral equations. This method has been shown to be a powerful numerical tool for finding fast and accurate solutions. So, in this paper, some properties of the Sinc-collocation method required for our subsequent development are given and are utilized to reduce integral equation of the first kind to some algebraic equations. Then convergence with exponential rate is proved by a theorem to guarantee applicability of numerical technique. Finally, numerical examples are included to demonstrate the validity and applicability of the technique.