Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
2Activity
0 of .
Results for:
No results containing your search query
P. 1
Secure Communication with Flipping Substitute Permutation Algorithm for Electronic Copy right Management System

Secure Communication with Flipping Substitute Permutation Algorithm for Electronic Copy right Management System

Ratings: (0)|Views: 104 |Likes:
Published by ijcsis
The main objective of this paper is to detect the existence of secret information hidden within an image. Cryptography is one of the most interested and important area in the computer industry that deals with secures transmission of information. Encryption, the process which helps for such secure transmission prevents hackers to access the information. And decryption helps to retrieve the original information. Cryptography provides many methods and techniques for secure communication. Currently there are many industry standard encryption/decryption algorithms including RSA, Rijndael, Blowfish and so forth. However, they are fairly complex and require that one spend a lot of time to comprehend and implement them. This paper introduces simple Encryption/decryption algorithm that is fast and fairly secure. The algorithm manipulates a 128-bit input using flipping, Substitution, and Permutation to achieve its encryption/decryption.
The main objective of this paper is to detect the existence of secret information hidden within an image. Cryptography is one of the most interested and important area in the computer industry that deals with secures transmission of information. Encryption, the process which helps for such secure transmission prevents hackers to access the information. And decryption helps to retrieve the original information. Cryptography provides many methods and techniques for secure communication. Currently there are many industry standard encryption/decryption algorithms including RSA, Rijndael, Blowfish and so forth. However, they are fairly complex and require that one spend a lot of time to comprehend and implement them. This paper introduces simple Encryption/decryption algorithm that is fast and fairly secure. The algorithm manipulates a 128-bit input using flipping, Substitution, and Permutation to achieve its encryption/decryption.

More info:

Published by: ijcsis on Jun 05, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

07/24/2011

pdf

text

original

 
 
Secure Communication with Flipping SubstitutePermutation Algorithm for Electronic Copy rightManagement System
1
C. PARTHASARATHY
2
G.RAMESH KUMAR
3
Dr.S.K.SRIVATSAAssistant professor in IT Dept Assistant Professor Senior professor
1
Sri Chandrashekhendra Saraswathi Viswa Mahavidyalaya University,Enathur, Kanchipuram – 631 561, sarathy286089@rediffmail.com,
2
Department of Computer Science & Applications,Adhiparasakthi College of Arts & ScienceG.B.Nagar, Kalavai - 632 506,Vellore District. Tamil Nadu, grk92804@rediffmail.com
3
St. Joseph’s College of Engg, Jeppiaar Nagar, Chennai-600 064 profsks@rediffmail.com
 Abstract-
The main objective of this paper is to detectthe existence of secret information hidden within animage. Cryptography is one of the most interested andimportant area in the computer industry that deals withsecures transmission of information. Encryption, theprocess which helps for such secure transmissionprevents hackers to access the information. Anddecryption helps to retrieve the original information.Cryptography provides many methods and techniquesfor secure communication. Currently there are manyindustry standard encryption/decryption algorithmsincluding RSA, Rijndael, Blowfish and so forth.However, they are fairly complex and require that onespend a lot of time to comprehend and implement them.This paper introduces simple Encryption/decryptionalgorithm that is fast and fairly secure. The algorithmmanipulates a 128-bit input using flipping, Substitution,and Permutation to achieve its encryption/decryption
.
 Keywords - Cryptography, Hacker, Security, attackSteganography, Watermarking, compression, authentication
.I. INTRODUCTIONSteganography is a Greek word meaning covered orhidden writing. It is the art and science of secretco+mmunication, aiming to conceal the existence of the communication. This is a different fromCryptography, where the existence of thecommunication is not disguised but the message isobscured by scrambling it. Use of cryptographywould not stop a third party knowing that some secretcommunication is going on. In steganography, themessage to be sent is concealed in such a way that anintruder would not know whether any secretcommunication is going on or not. Hidinginformation inside digital carriers is becomingpopular. A rapid growth in demand and consumptionof multimedia has resulted in data hiding techniquesfor files like audio (.wav), images (.bmp, .pnm, .jpg).Digital images are most common sources for hidingmessage. The process of hiding information is calledan embedding.Still and multi-media images are subject totransformations for compression, steganographicembedding and digital watermarking. We proposenew measures and techniques for detection andanalysis of steganographic embedded content. Weshow that both statistical and pattern classificationtechniques using our proposed measures providereasonable discrimination schemes for detectingembeddings of different levels
.
Many algorithms are developed for encryption anddecryption which provides high security. All thesealgorithms are kept open to the public and the secrecyof the algorithm lies entirely in the key. This paperstands different that the development of algorithmaddresses the user needs in specific, thereby offeringmore flexibility. With the help of socket program,establish a connection between client and server.Different segments of secrete picture were passed asfile objects to the server from client.II. PROBLEM DEFINITION - PROPOSEDALGORITHMSecure communication with the help of FSPalgorithm as follows:Step 1: Set the flipping bit.Step 2: Change the characters according to theflipping bit.Step 3: Check the ASCII table and find keys.Step 4: With the help of the keys, make a squarematrix, using inverse table.Step 5: Do flipping operation.Step 6: Repeat the steps 2 to 5.
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 5, May 201185http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
 
In Fig 1, PT is the Plain text and CT is the Ciphertext.
Figure 1. Encryption with 8 levels
A. Flipping OperationOne piece of the secret information is theflipping key and its length is 128 bits, and it is usedto obscure the plaintext or cipher text further. Given a128-bit input PT (Plain Text) and a flipping key F,We denote the flipping operation on PT as below:
Output=Flip (F, PT)
In the flipping operation, its 128- bit input isdisguised as follows: For each bit of the input, if thecorresponding bit of the flipping key is 0, thecorresponding bit of the flipping key is 1, thecorresponding output bit will be the complement of the input bit. That is, if the flipping key bit is 0 andthe input bit is 0/1, the output of the flippingoperation is 0/1. On the other hand, if the flippingkey bit is 1 and the input bit is 0/1 the output of theflipping operation is 1/0. In reconstructing theoriginal input, the output of the flipping operation isflipped against the same flipping key.B. Substitution OperationThis algorithm uses substitution and InverseSubstitution table for encryption and decryption.These tables are generated based upon the ASCIIcode and the key. Let PT be the plain text, CT be theCipher text and Key be the Flipping key. In this,plain text as a text file. This file will have all theASCII characters. The ASCII characters are given inthe Table 3. In this, the rows indicate the left digitand the column indicates the right digit. Again thistable is subdivided into subsets. For dividing thesubset into blocks, we have to follow the followingprocedure. If the no of characters is less than orequal to 10, we have to divide this into two halves. If the number of characters is even number, we divide itinto equal halves. Suppose, the number of charactersis odd number, we have to divide this into 2 subsetsbut the size of the first subset is greater than thesecond subset by 1. To construct the substitutiontable 2, it uses key and it will be informed to thereceiver in a secure manner.
K= 15 7 14 6 13 5 12 4 8
 
1 9 2 10 3 11
[Numbers 1 to 15 occurring in the key correspondingto the above table]Using the above key, Flipping key is determined. Sothe length of the Flipping key is 128bit (ie, 16 x 8 =128).And Using this key the substitution table and Inversesubstitution table is also constructed.
Table 1 – ASCII Table
Again this table is divided into subsets.
Table 2 – Subset TableTable 3 – Block Table
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 5, May 201186http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
 
Table 4 – Substitution TableTable 5 – Inverse Substitution Table
C. Permutation Operation Proposed FoldingTechniqueThe origin of folding is from paper folding nature.This folding is broadly divided into 3 angles of processing:1.
 
Vertical Folding2.
 
Horizontal Folding3.
 
Diagonal FoldingConsider there are 5 rows present in the plain textdocument. Cipher text created with respect to
1
52
43
'3Note : Exchange occurs
the horizontal folding method finds the mid-row of whole text. With respect to that mid row subsequentrows are exchanged.
PLAIN TEXT CIPHER TEXTA B C D E E D C B AF G H I J J I H G FK L M N O O N M L KP Q R S T T S R Q PU V W X Y Y X W V U
Figure 2.Vertical Folding Technique
PLAIN TEXT CIPHER TEXTA B C D E U V W X YF G H I J P Q R S TK L M N O K L M N OP Q R S T F G H I JU V W X Y A B C D E
Figure 3.Horizontal Folding Technique
PLAIN TEXT CIPHER TEXTA B C D E A F K P UF G H I J B G L Q YK L M N O C H M R WP Q R S T D I N S XU V W X Y E J O T Y
Figure 4.Diagonal Vertical Folding TechniqueIn the case of vertical folding methodcolumns are exchanged dynamically. It is same ashorizontal folding using column processing instead of row processing.The diagonal folding method must beimplemented in square matrix arguments. If notproper padding must be added to get the appropriatesolution. On the side of decryption padding must beeliminated after processing.
for(int i=0;i<5;i++)for(int j=0;j<5;j++){int p=(i*10)+j;for(int k=0;k<5;k++)for(int q=0;q<5;q++){if(p==a[k][q])b[i][j]=((k+1)*10)+q+1;}
Program 1.Substitution - forming inverse table
D. Encryption LevelThe last piece of the secret information isthe encryption level. It is a positive integer. Thehigher the encryption level is, the more secure thealgorithm is. However, we should be cautious withlarge values of the encryption level since theincreasing of the encryption level is proportional tothe decreasing of the Encryption / decryption speed.E. Traffic padding
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 5, May 201187http://sites.google.com/site/ijcsis/ISSN 1947-5500

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->