09-04-2011, 02:25 PM
Presented by:
Mr. Sudarshan. M
Mr. Kiran .B
Mr. Sachin.B
Mr. Vilas.C
[attachment=11926]
A New Chaotic Algorithm for Image Encryption
Aim:
A new image encryption algorithm is presented based on Henon chaotic maps in order to meet the requirements of the secure image transfer.
Present Theory:
Technique for securing digital data is cryptography. Cryptography scrambles the message through an encryption process . DES is one of the cryptography algorithm. DES uses key size of 56 bits and has 16 iterations. It produces block size of 64 bits.DES is not good cryptography algorithm for large text files and images. DES encryption take computer processor time. DES technique was attacked and broken by brute force in 1998 and hence proved to be inefficient .
Overcome:
Chaotic algorithm uses an image sort transformation to shuffle the position of image pixels. The chaos-based encryption has suggested a new and efficient way to deal with the intractable problem of fast and highly secure image encryption. There have been many papers on chaotic encryption scheme. Therefore, chaotic cryptosystems have more useful and practical applications.
Disadvantages:
Consumes time if image file size is large.
Not fit if network speed is slow.
Proposed System:
The proposed encryption algorithm:
The image encryption algorithm includes two steps. Firstly, the image fusion is completed between the original-image and the key-image. Then the pixel values of the fusion-image are encrypted by Henon chaotic system.
Image fusion:
Graphics fusion technique can be used in image fusion. According to the image pixel, image fusion can be completed between the same size images. Image fusion is described as following:
E(i,j)=w*(K(i,j)-O(i,j))+O(i,j)
0<=w<=1
Where w is parameter, K(i, j) is the pixel values of the key-image ,O(i, j) is the pixel values of the original-image, and E(i, j) is the pixel values of the fusion-image.
Encryption by Henon chaotic:
Henon chaotic map is first discovered in 1978,which is described as following:
xi+1=1-axi2+yi
yi+1=bxi,i=0,1,2,…..
Experimental Analysis:
The original-image with the size 256×256 is shown below. The key image is chosen as w 0.8 .Image fusion is first step of image encryption. The parameters are selected as a 0.3 ,b 1.4.
The secret keys to change the pixel values of the original fusion-image are x0=0.1,x1=0.2. Since the chaotic systems are deterministic, the receiver can reconstruct the same fusion-image exactly using the secret keys.
The antiprocess of image fusion is described as:
O(i,j)=1/w*(E(i,j)-K(i,j))+K(i,j)
0<=w<=1
Where w is parameter, O(i, j) is the pixel values of the original-image, E(i, j) is the pixel values of the fusion-image, and K(i, j) is the pixel values of the key-image. The parameter is chosen as w 0.8 .The receiver can reconstruct the same original-image using the same parameters.
Security Analysis:
A good encryption scheme should be sensitive to the secret keys, and the key space should be large enough to make brute-force attacks infeasible. In our encryption algorithm, the key-image and the initial values of Henon chaotic map are used as secret keys.
The key space is large enough to resist all kinds of brute-force attacks. The experimental results also show that our scheme is very sensitive to the secret key mismatch.
Advantages:
This algorithm provides efficient way for image encryption.
Provides security for image transmission.
Software Requirements:
O.S:Windows XP
Language: JAVA, JAVA-swing
DB: MS- Access
SDK JDK1.6
Conclusion:
This encryption scheme is suitable for applications like Internet image encryption and secure transmission of confidential information in the Internet
Mr. Sudarshan. M
Mr. Kiran .B
Mr. Sachin.B
Mr. Vilas.C
[attachment=11926]
A New Chaotic Algorithm for Image Encryption
Aim:
A new image encryption algorithm is presented based on Henon chaotic maps in order to meet the requirements of the secure image transfer.
Present Theory:
Technique for securing digital data is cryptography. Cryptography scrambles the message through an encryption process . DES is one of the cryptography algorithm. DES uses key size of 56 bits and has 16 iterations. It produces block size of 64 bits.DES is not good cryptography algorithm for large text files and images. DES encryption take computer processor time. DES technique was attacked and broken by brute force in 1998 and hence proved to be inefficient .
Overcome:
Chaotic algorithm uses an image sort transformation to shuffle the position of image pixels. The chaos-based encryption has suggested a new and efficient way to deal with the intractable problem of fast and highly secure image encryption. There have been many papers on chaotic encryption scheme. Therefore, chaotic cryptosystems have more useful and practical applications.
Disadvantages:
Consumes time if image file size is large.
Not fit if network speed is slow.
Proposed System:
The proposed encryption algorithm:
The image encryption algorithm includes two steps. Firstly, the image fusion is completed between the original-image and the key-image. Then the pixel values of the fusion-image are encrypted by Henon chaotic system.
Image fusion:
Graphics fusion technique can be used in image fusion. According to the image pixel, image fusion can be completed between the same size images. Image fusion is described as following:
E(i,j)=w*(K(i,j)-O(i,j))+O(i,j)
0<=w<=1
Where w is parameter, K(i, j) is the pixel values of the key-image ,O(i, j) is the pixel values of the original-image, and E(i, j) is the pixel values of the fusion-image.
Encryption by Henon chaotic:
Henon chaotic map is first discovered in 1978,which is described as following:
xi+1=1-axi2+yi
yi+1=bxi,i=0,1,2,…..
Experimental Analysis:
The original-image with the size 256×256 is shown below. The key image is chosen as w 0.8 .Image fusion is first step of image encryption. The parameters are selected as a 0.3 ,b 1.4.
The secret keys to change the pixel values of the original fusion-image are x0=0.1,x1=0.2. Since the chaotic systems are deterministic, the receiver can reconstruct the same fusion-image exactly using the secret keys.
The antiprocess of image fusion is described as:
O(i,j)=1/w*(E(i,j)-K(i,j))+K(i,j)
0<=w<=1
Where w is parameter, O(i, j) is the pixel values of the original-image, E(i, j) is the pixel values of the fusion-image, and K(i, j) is the pixel values of the key-image. The parameter is chosen as w 0.8 .The receiver can reconstruct the same original-image using the same parameters.
Security Analysis:
A good encryption scheme should be sensitive to the secret keys, and the key space should be large enough to make brute-force attacks infeasible. In our encryption algorithm, the key-image and the initial values of Henon chaotic map are used as secret keys.
The key space is large enough to resist all kinds of brute-force attacks. The experimental results also show that our scheme is very sensitive to the secret key mismatch.
Advantages:
This algorithm provides efficient way for image encryption.
Provides security for image transmission.
Software Requirements:
O.S:Windows XP
Language: JAVA, JAVA-swing
DB: MS- Access
SDK JDK1.6
Conclusion:
This encryption scheme is suitable for applications like Internet image encryption and secure transmission of confidential information in the Internet