Cryptography and Steganography For Secure Communication

cryptograph and Steganography For Secure CommunicationCombination of cryptanalytics and Steganography for secure discourse is a creature that combines both arcanum writing methods and Steganography proficiencys for secure confabulation. The coer is a cross-platform tool that clear be effectively track a centre inside a digital depiction point. In the field of selective schooling communication, security measure has the top priority. Cryptography is star of the technique for secure strike up schoolbookbook inwardnesss. Cryptography makes the necessary elements for secure communication namely privacy, confidentiality, rudimentary out trade and authentication unless reveals the fact that communication is happening. Steganography takes cryptograph a step removedther by conceal the organism of the culture.Steganography plays a resilient role in the information communication field in the early primarily in computer security and privacy on straight-from-the -shoulder systems such as internet.The issue at a lower place1, gives polar acts of Steganography. Protection against catching ( data concealing) and rampart against removal (Document Marking) ar deuce major beas Steganographic methods argon usage. Steganographic Data hiding algorithmic programic programs countenances user to hide heavy(a) amounts of information within digital files comparable Image, audio and citationisation files. These forms of Steganography often use in conjunction with cryptography adding layers of security.The Other major atomic number 18a of Steganography is register marking where the deputizeject to be inserted is used to assert copyright over a catalogue. This sack be further divided into watermarking and fingerprinting. Copyright abuse is the motivating factor in developing new record marking technologies alike digital watermarking and digital fingerprinting. Digital Watermarking is a way to hide a mystic or personal substance to protect a products copyright or to traffic circle up data integrity. Digital Fingerprintingis an emerging technology to protect multimedia system from unauthorized redistri howeverion. It embeds a unique ID into each users copy, which advise be extracted to do identify culprits when an unauthorized leak is found 2.Neither Cryptography nor Steganography is a turn pick up solution to privacy of open systems. To add multiple layers of security it is alship canal a good practice to use both Cryptography and Steganography to bindher.While performing Cryptography we should know two formulas ( Cipher formula, decode formula).RationaleTo make the communication much secure in this application we ar implementing three layers of security like Steganography, Cryptography and Compression. The application foremost compresses the account book document with mystery pass, and then encrypts the compressed file and uses the resulted file as the secret message to hide in the digital boob tube file generating a Stego- aim. The int wipeout receiver de-embeds decrypts and decompresses the Stego-object respectively to get the private message. This paper excessively attempts to identify the requirements of a good Steganographic algorithm and briefly reflects on different types of steganalysis techniques.The application uses Tiny encoding algorithm and clear-cut Cosine Transformation-Least of import art object algorithm for implementing Cryptography and Steganography respectively. The outcome of this support is to create a cross-platform tool that can effectively hide a message (i.e. Word document) inside a digital video file. It is touch on with embedding information in a secure and robust manner.REVIEW OF relevant LITERATUREBackground to subject of studyThe idea of building this tool is to make the communication is such a way that no star can detect the message inside the stego-object. Earlier we get tools for different tools for Steganography and Cryptograp hy. In this tool we are implementing three layers of security (Steganography, Cryptography and Compression) so that the communication can be more secure and all can be done in a single tool quite of utilize three different tools. Steganography has came into usage in 1990s and it is equable victimisation in many ways by Governments, Private citizens, patronage and Terrorist organizations for communication to share information and passwords.Cryptography came into consideration in eighteenth century. The closing of cryptography is to make it possible for two communication entities to exchange a message in such a way that no third party can understand the message. Cryptography has been implementing from many days, in the World war Germany and USA. They consider used it in overlap messages and apply machines to implement cryptography.Examples and critique of current research in the field in that respect are many tools that are implementing Steganography now a days. The SARC (St eganography Analysis and look Center has utilize three tools in steganography like Steganography Analyzer artefact image scanner, Steganography Analyzer Signature scanner and Steganography Analyzer Real-Time Scanner. The Steganography Analyzer artefact Scanner detect files and registry entries associated with steganography applications where as Steganography Analyzer Signature Scanner detect files containing steganography and extract the confidential information and the Steganography Analyzer Real-Time Scanner detect steganography artifacts and signatures in real-time over a network.S-Tool is withal one of the steganography tool that is using now a days. Its free to download and hides the data in an image or sound file. It compresses the data before encrypting and hides it in a image file or audio file.PILOT enquiry STUDYHypothesisAs sending the message get out be easy for unauthorized persons to detect the information in the situations like passwords sharing and confidential information sharing. So for that we have methods that can make the information secure. By using Steganography and Cryptography techniques we can share the information more securely by hiding the information in other files. sluice though we have whatsoever risks that are involved in these techniques we can be rectified to certain extend by using this tool. interrogation methodThis application is implemented for secure transmission of data. In this application we have three layers of security like compression, Cryptography and Steganography. We are using different type of algorithms in Cryptography and Steganography so that the hackers can non identify which algorithm is supposed to be used.In secret get word Cryptography some(prenominal) algorithms are in cognitive operation like Data encoding stock (DES), Rivest Chipers (aka Rons Code), Advanced encryption Standard (AES), Blowfish and CAST-128/256. In public break Cryptography we have Elliptic abridge Cryptography(ECC), El Gamal, Digital signature algorithmic program (DSA), Diffie-Hellman and RSA algorithms mostly isong now a days. In hash bleed in Cryptography Hash of variable length(HAVAL), Tiger, RIPEMD, Secure Hash Algorithm (SHA) and capacity Digest Algorith(MD) are in use. Tiny encoding Algorithm is also one of the Feistel Cipher encryption algorithm that was designed in 1994 is used in Cryptography that uses multiform orthogonal algebraic groups like ADD, moorage and XOR.In steganography we are using different Steganographic methods for hiding information into a video file like LSB (Discrete Cosine Transformation-List Significant morsel Encoding). distributively frame in a video file holds a fraction of secret message.Cryptography use cipher algorithm for encryption and decipherment of data. In the previous decades they were used ciphers like Scytale Transportation Cipher, Caesar Substitution Chiper, Zodiac Chiper and Vigenere Polyalphabetic Substitution.both Steganography and Crypto graphy are data security techniques, but the cryptography is implemented to data unread and Steganography in for data unseen. Steganography can use Cryptography where as Cryptography can non use Steganography. Steganography implemented to Cryptographic data volition increase in security level.Initial ResultsIn this application i am implementing three layers of security to make the information more secure. on that point are no any tools that implementing all the three layers like compression, Cryptography and Steganograpy. We have tools for steganography like S-Tool and for Cryptography. By using one tool alternatively of using three tools give save time and money with more security. This is the basic advantage of this application. The help document go out guide in Interface.OUT LINE OF PROPOSALAims of the InvestigationThe aim of this paper is to divulge a method for integrating together cryptography and Steganography for secure communication using a Video file. The proposed sys tem first compresses the secret message (i.e. word document) and then implements cryptographic algorithms to the compressed message. The resulted file is used as the secret message to be hidden in the digital video file. Once the video file is embedded with the secret message, it is sent to the intended receiver. The video file should be de-embedded, decrypted and decompressed to get the original secret message hence, adding three layers of security to the communication. I am going to design a good Graphical User Interface (GUI) with help notes so that anyone can understand ahout the application easily.Research ObjectivesThe objective of this project is to hide secret messages (e.g. schoolbook Phrase, word document) inside other harmless messages such as Image and Video file, in a way that does not allow any third party to even detect that there is a second secret message present in it. The application implements this by combining the Steganographic methods with Cryptographic techn iques (i.e. encoding, decryption) to make the sell more secure. It is concerned with embedding information in a secure and robust manner. The Text file will be compressed and after that the compressed file will go on with a Cryptography and Steganography.MethodologiesModules of the Application The application has two sensory systems of operation i.e. Sender and Receiver.The three major modules for Sender mode of application areCompression The application first compresses the document to be transferredEncryption An Encryption algorithm encrypts the compressed file and the resulted file is used as secret message.Embedding The encrypted file is hidden in the Harmless Message (video file) using match Steganographic algorithm, which generates a Stego Object, which is sent to the intended recipient.The three major modules for the Receiver mode of application areDe-Embedding The Stego Object is de-embedded generating an encrypted file. decryption The encrypted file is decrypted using a n the Encryption algorithm, and the resulted file is presumption to the compression moduleDe-Compression The application then de-compresses the document and we have the Secret message.Steganography and cryptography are closely related. Cryptography scrambles messages so they cannot be understood Whereas, Steganography will hide the message so there is no acquaintance of the existence of the message 7. Sending an encrypted message will arouse suspicion plot an invisible message will not do so. The application developed in this project combines both sciences to attain better protection of the message. Even if the Steganography fails since the message is in encrypted form it is of no use for the third party, hence the information is secure.In Cryptography we have used three types of methodologies and are implemented depending on the encryption Algorithm.They are Secret draw Cryptography, popular key Cryptography and hash maneuver. These 3 methods are briefly explained below.Secr et Key CryptographySecret key Cryptography, also known as symmetric encryption uses uniform key for encryption and decryption. The sender uses key to encrypt the text and sends ciphertext to the receiver. The receiver applies the same key to decrypt the message and re get the picture the Text.K KText Ciphertext TextE( ) D( )K-key, E-Encryption, D-DecryptionSecret key CryptographyThe above effigy shows the serve up of secret key cryptography. The biggest difficulty with this approach is the distribution of the key. tug ciphers can operate in one of the several modes. Electronic Codebook (ECB), Cipher Block Chaining (CBC), Cipher Feedback (CFB), Output Feedback (OFB) are the most important modes. Data Encryption Standard (DES), Advanced Encryption Standard (AES), CAST-128/256, Rivest Ciphers (aka Rons Code), Blowfish are some of the Secret key cryptography algorithms 3.Public-Key CryptographyK1 K2Text Ciphertext TextE( ) D( )K-key, E-Encryption, D-DecryptionPublic key Cryptography Public key cryptography is a two-key cryptography system in which two keys are used in encryption and decryption for secure communication without having to share a secret key. peerless key is used to encrypt the text, designated the public key which can be advertised. The other key is used to decrypt the ciphertext to plaintext and is designated the private key which is never revealed to another party. This approach also called as asymmetric cryptography, because we use a pair of keys. The figure shows the work at of the public cryptographic algorithms. Public key cryptography depends upon the one-way functions, which are easy to compute whereas their inverse function is relatively difficult to compute. RSA, Diffie-Hellman, Digital signature Algorithm (DSA), ElGamal, and Elliptic Curve Cryptography (ECC, are the examples of Public-key cryptography algorithms 3.Hash FunctionsHash functions, are also called as message digests and one-way encryption. Hash function algorithms do not u se a key to carry out the encryption and decryption process. Instead, the algorithm computes a fixed length hash cling to base upon the text that keeps both the contents and the length of the message secure.Tiny Encryption Algorithm is a Feistel cipher encryption algorithm that uses operations from mixed orthogonal algebraic groups like XOR, ADD and SHIFT. David Wheeler and Roger Needham of the Cambridge University Computer science lab designed tea in the year 1994.A Feistel cipher is a block cipher with a structure known as a Feistel network. In a Feistel cipher, the data been encrypted is split into two halves. The function F( ) is use to one half using a sub key and the widening of F() is XORed with the other half and the two halves are swapped. Each round function follows the same pattern except for last round. A nice boast of a Feistel cipher is that encryption and decryption are identical i.e. the sub keys used during encryption at each round are taken in reverse order while decryption 4.The main goal of teatime is to minimize memory footprint and maximize speed. tea leaf is simplistic to implement, has less execution time, and takes minimal storage space. TEA uses a large subjugate of iterations rather than a complicated program.Notation Any ha stingude subscripted with h represents a Hexa ten-fold numbere.g 10h represents 16 in decimal care fors.Notations for Bitwise Shifts and Rotationsx x y denotes logical right shift of x by y minute of arcs.x x y denotes right rotary motion of x by y bits.XORIn computer science, an XOR is a numeric operation that combines two bits. It returns value is TRUE if either of the two bits is TRUE, but false if both are equal. For our cryptography algorithm, we do an XOR combining two forces of bits. Say x and y are two string patterns then XOR for x and y is denoted by xy 4.whole number Addition and SubtractionThe operation of integer addition modulo 2n is denoted by and tax deduction modulo 2n is deno ted by. Where x, y Z2n (The value of n should be clear from the context)The key is set at 128 bits and the key schedule algorithm splits the 128-bit key K into cardinal 32-bit blocks K = ( K0, K1, K2, K3). The 128-bit key is adequate to prevent simple search techniques macrocosm effective 4.Encryption unremarkableThe Encrypt bite given in figure 4, is written in the C language and as pluses a 32-bit word size. The 128 bit key is split into four parts and is stored in K0 k3 and the Data is stored in v0 and v1.void code(long* v, long* k) unsigned long y=v0,z=v1, sum=0, /* set up */delta=0x9e3779b9, /* a key schedule unvarying */n=32 while (n0) /* basic cycle start */sum += delta y += ((z5)+k1) z += ((y5)+k3) /* end cycle */v0=y v1=z Encryption Routine for TEAThe constant delta is given as delta = (5 -1) * 231 i.e. 9E3779B9h and is derived from the golden number ratio to ensure that the sub keys are distinct and its precise value has no cryptographic significance.TEA uses ad dition and subtraction as the correctable operators instead of XOR. The TEA encryption routine relies on the alternate use of XOR and ADD to provide nonlinearity. The algorithm has 32 cycles (64 rounds). TEA is short enough to write into almost any program on any computer. TEA on one implementation is three times as steadfast as a good software implementation of DES, which has 16 rounds. The figure shown below 4, gives an overview of two rounds i.e. one cycle of TEA.Key size 128 bit key is split into four subkeys K = K0,K1,K2,K3 Block size 64 bitsStructure Feistel NetworkRounds Variable (64 Feistel rounds (32 cycles) is recommended)..Represents Integer addition moduloRepresents XORRepresents logical unexpended shift by 4 bitsRepresents logical right shift by 5 bitsTwo Feistel Rounds (one cycle) of TEAInputs for the Encryption routine Plaintext P, Key KThe plaintext is split into two halves as P= (Left0,Right0)Output for the Encryption routine The cipher text is CWhere C=(Left64, Right64).The plaintext block is split into two halves, Left0 and Right0 and each half is used to encrypt the other half over 64 rounds of processing then combined to produce the cipher text block. Each round i has inputs Lefti-1 and Righti-1, derived from the previous round, as well as a sub key Ki derived from the 128 bit overall K.The Output and the delta constant of the ith cycle of TEA are given asLeft i+1 = LeftiF ( Righti, K 0, 1, deltai ),Right i +1 = RightiF ( Righti +1, K 2, 3, deltai ),deltai = (i +1)/2 * delta,The sub keys Ki are different from K and from each other.The Round function F contains the key addition, bitwise XOR and both left(p) and right shift operations, and given asF(M, Kj,k, deltai ) = ((M 5) Kk)F Round function and Ki key for the ith roundEncryption Process for TEAThe keys K0 and K1 are used in the odd rounds and the keys K2 and K3 are used in even rounds. The round function of TEA encryption algorithm differs fairly from a classical Feistel cipher structure where integer addition modulo-2 is used instead of XOR as the combining operator. The above figure4 gives an overview of the encryption process for TEA.Decryption Routinevoid decode(long* v, long* k) unsigned long n = 32, sum, y = v0, z = v1,delta = 0x9e3779b9 sum = delta/* start cycle */while (n0) z = (y5)+k3 y -= (z5)+k1 sum -= delta /* end cycle */v0 = y v1 = z Decryption Routine for TEAThe decryption routine shown in the figure4, is same as the encryption routine with the cipher text as input and the sub keys Ki are used in the reverse order.Inputs for the Decryption routine Cipher text C, Key KThe cipher text is split into two halves as C= (DLeft0,DRight0)Where Dleft0=ERight64 and DRight0=Eleft64Output for the Decryption routine The plain text is P, Where C=(DLeft64, DRight64).F Round function and Ki key for the ith round.Decryption Process for TEAThe figure 4 gives the structure of the decryption algorithm for TEA. The intermediate value for the decryption pro cess equals the corresponding value of the encryption process with the two halves of the value swapped. For example say the output of the nth round of the encryption process is ELefti concatenated with ERighti then the input to the (64-i)th decryption round is DRighti concatenated with DLefti.DCT-LSB (Discrete Cosine Transformation-List Significant Bit Encoding)DCT-LSB is a Steganographic method is a substitution algorithm used for hiding information behind Video files. Each frame in the video holds a part of the secret message. Discrete Cosine Transform (DCT) transforms concomitant 8 - 8 pixel blocks of the frame into 64 DCT coefficients each. The DCT coefficients D(i, j) of an 8 - 8 block of image pixels p(x, y) are given by the formula belowLeast Significant Bit (LSB) is a simple Steganographic method that takes the respective(prenominal) pixels of the frame and replaces the least significant bits with the secret message bits. It is by far the most popular of the coding techniq ues used. The process of LSB algorithm is shown in the figure below.EmbedExtractLSB ProcessWe can commandeer the least significant bit of 8-bit true color image to hold each bit of our secret message by simply overwriting the data that was already there. The impress of changing the least significant bit is almost imperceptible.Input message, cloak imageOutput steganographic object containing messagewhile data left to embed doget next DCT coefficient from cover fileif DCT 0 and DCT 1 thenget next bit from the Secret messagereplace DCT LSB with message bitend ifinsert DCT into steganographic objectend whileEmbedding Process of DCT-LSBInput steganographic object containing messageOutput message, cover imagewhile data left to extract doget next DCT coefficient from Stego objectif DCT 0 and DCT 1 thenExtract the DCT LSB bit from the objectCopy to message fileend ifend whileExtracting Process of DCT-LSBThe above figures5 gives algorithms for embedding and extracting secret informati on in video files using DCT-LSB algorithm respectively.DEFLATE COMPRESSION ALGORITHMDEFLATE is a no loss compressed data format that compresses data using a combination of the LZ77 algorithm and Huffman coding.Independent of CPU type, operating system, file system, and character setCompatible with widely used gzip utilityWorst fictional character 5bytes per 32Kbyte block6.Ethical ConsiderationsThere are two possible ways of attacks on Steganography (Detection and Destruction) of embedded message. The properties of the file in which we are hiding information will differ whenhiding message into it. The Steganalysis will find it and analyse the stego object.Steganalysis is the technique used to detect hidden messages in digital data like video or audio file steganographically7. Steganalysis is used to disrupt the steganographic elements to transfer by extracting, disabling or disrupting.Detection Most Steganographic techniques involve in changing the properties of original harmless me ssages like Image and Video files and the detection algorithms concentrate on detecting these changes 8. spying the existence of a hidden message will save time in the message body waste phase by processing only those digital files that contains hidden information. Detecting an embedded message defeats the primary goal of Steganography techniques that is concealing the very existence of a message 8. The algorithms vary in their approaches for hiding information. Without knowing which algorithm is used and which Stego-key is used, detecting the hidden information is quite complex.Destruction or Defeating algorithms concentrate on removing the hidden messages from the Stego object 8.Steganalysis techniques are similar to the cryptanalysis for the cryptography methods.As we have discussed previously.Harmless Message + secret message + stego-key = stega-objectSome of the known attacks for the Steganography are stego-only, known cover, known message, elect stego, and chosen message.In Cryptography there are many types of Cryptographic attacks. The attacks are done on the Cipher text. There are some of the ways to attack cipher text like Brute force attacks, make full in the middle attack, Birthday attack and side channel attack9. visualize Time TableActivityNov 09Dec09Dec09Dec09Jan09Jan09Jan 09Jan09Feb 09Selection of topicXXanalyzingXXResearchXXLiterature reviewXXintroductionXXRationaleXXmethodologiesXXInitial resultsXXconclusionXXAfter the approval of the research proposal the project will be started. The dissertation will be preceded according to the steps that are given by the supervisor.Limitations and ScopeSteganography is an effective way to obscure data and hide sensitive information. The effectiveness of Steganography is amplified by combining it with cryptography. By using the properties of the DCT-LSB Steganography algorithm for video file and combining it with the TEA cryptography standards, we developed a method, which adds layers of security to the communication. Steganographic methods do not intended to replace cryptography but supplement it.The strength of our system resides in adding multiple layers of security. First the secret message i.e. word document to be transferred is compressed, encrypted and then embedded in a video file using Steganographic algorithm hence, adding three layers of security. The impuissance of the system developed is the size of the secret file i.e. word document after compression should be less than the size of the Cover object i.e. Video file. Since we are using compression algorithm this happens only for considerable documents.As future work, we intend to study more steganalytic techniques i.e. detecting whether a particular file contains any form of embedding or not. We also visualize to extend our system so that it can hide digital files in other digital files, for example hiding Audio files in Videos files and so forthPersonal Development and RequirementRegarding this research a brief know ledge on steganography and cryptography and the methods that are used in embedding and de-embedding file. We should also have a brief idea on encryption and decryption algorithms in cryptography. In this application we can also encrypt strings and document files.Resource reruirementsThis Application will work on any Microsoft operate systems and the hard disk should have atleast of 4 MB memory. The RAM should be 256 Mega Bytes or higher.