Combination of Cryptography and Steganography for secure communication is a tool that combines both Cryptography methods and Steganography approaches for secure communication. The application form is a cross-platform tool that can be effectively hide a message inside a digital video file. In neuro-scientific data communication, security has the top priority. Cryptography is one of the technique for secure plain texts. Cryptography makes the required elements for secure communication particularly privacy, confidentiality, key exchange and authentication but shows the actual fact that communication is happening. Steganography calls for cryptography a step farther by hiding the living of the info.
Steganography performs a essential role in the info communication field in the foreseeable future mainly in computer security and personal privacy on available systems such as internet.
The amount below[1], offers different applications of Steganography. Protection against diagnosis (Data covering) and cover against removal (Record Marking) are two major areas Steganographic methods are utilized. Steganographic Data covering algorithms allows user to hide large amounts of information within digital files like Image, audio and video files. These types of Steganography often found in conjunction with cryptography adding tiers of security.
The Other major region of Steganography is doc marking where in fact the subject matter to be put is used to say copyright on the document. This is further split into watermarking and fingerprinting. Copyright abuse is the motivating factor in developing new file marking technology like digital watermarking and digital fingerprinting. "Digital Watermarking is ways to hide a key or personal concept to protect a product's copyright or to illustrate data integrity". "Digital Fingerprinting can be an emerging technology to protect multimedia system from unauthorized redistribution. It embeds a unique Identification into each user's backup, that can be extracted to help identify culprits when an unauthorized leak is available" [2].
Neither Cryptography nor Steganography is a turnkey way to privacy of wide open systems. To include multiple layers of security it will always be a good practice to use both Cryptography and Steganography collectively.
While performing Cryptography we should know two formulas ( Cipher formulation, Decipher formulation).
Rationale:
To make the communication better in this program we are employing three tiers of security like Steganography, Cryptography and Compression. The application form first compresses the term document with secret message, and then encrypts the compressed file and uses the resulted file as the secret message to cover in the digital video recording file generating a Stego-object. The expected device de-embeds decrypts and decompresses the Stego-object respectively to receive the hidden message. This newspaper also attempts to identify the requirements of your good Steganographic algorithm and briefly demonstrates on different kinds of steganalysis techniques. The application form uses Tiny encryption algorithm and Discrete Cosine Transformation-Least significant bit algorithm for applying Cryptography and Steganography respectively. The results of this project is to make a cross-platform tool that can effectively hide a note (i. e. Word file) in the digital video record. It is worried about embedding information in a secure and powerful manner.
REVIEW OF RELEVANT LITERATURE
Background to subject of review:
The notion of building this tool is to help make the communication is such a way that no one can detect the concept inside the stego-object. Previously we've tools for different tools for Steganography and Cryptography. With this tool we could implementing three tiers of security (Steganography, Cryptography and Compression) so the communication can become more secure and all can be carried out within a tool instead of using three different tools. Steganography has came into use in 1990's and it is still using in many ways by Government authorities, Private individuals, Business and Terrorist organizations for communication to share information and passwords.
Cryptography came into account in 18th century. The purpose of cryptography is to allow two communication entities to exchange a message in such a way that no alternative party can understand the communication. Cryptography has been applying from a number of days, on the planet warfare Germany and USA. They have got used it in sharing messages and applied machines to put into practice cryptography.
Examples and critique of current research in the field:
There a wide range of tools that are putting into action Steganography more recently. The SARC (Steganography Examination and Research Middle has implemented three tools in steganography like Steganography Analyzer Artifact Scanner, Steganography Analyzer Personal Scanner and Steganography Analyzer Real-Time Scanner. The Steganography Analyzer Artifact Scanner detect documents and registry entries associated with steganography applications where as Steganography Analyzer Signature Scanner detect files filled with steganography and draw out the invisible information and the Steganography Analyzer Real-Time Scanning device find steganography artifacts and signatures in real-time on the network.
S-Tool is also one of the steganography tool that is using more recently. Its absolve to download and hides the data within an image or audio record. It compresses the data before encrypting and hides it in a image data file or audio record.
PILOT RESEARCH STUDY
Hypothesis:
As sending the note will be possible for unauthorized persons to detect the information in the situations like passwords writing and confidential information showing. So for that we have methods that can make the info secure. Through the use of Steganography and Cryptography techniques we can reveal the information more firmly by hiding the information in other data. Even though we have some hazards that get excited about these techniques we can be rectified to certain increase by using this tool.
Research method:
This program is put in place for secure transmission of data. In this application we've three levels of security like compression, Cryptography and Steganography. We are employing different kind of algorithms in Cryptography and Steganography so that the hackers cannot identify which algorithm is supposed to be used.
In secret key Cryptography several algorithms are in operation like Data Encryption Standard (DES), Rivest Chipers (aka Ron's Code), Advanced Encryption Standard (AES), Blowfish and CAST-128/256. In public areas key Cryptography we've Elliptic Curve Cryptography(ECC), ElGamal, Digital personal Algorithm (DSA), Diffie-Hellman and RSA algorithms typically isong now a days. In hash function in Cryptography Hash of variable length(HAVAL), Tiger, RIPEMD, Secure Hash Algorithm (SHA) and Communication Digest Algorith(MD) are used. Tiny Encryption Algorithm is also one of the Feistel Cipher encryption algorithm that was designed in 1994 can be used in Cryptography that uses combined orthogonal algebraic categories like ADD, SHIFT and XOR.
In steganography we are using different Steganographic methods for concealing information into a training video document like LSB (Discrete Cosine Transformation-List Significant Bit Encoding). Each frame in a training video file holds a piece of secret subject matter.
Cryptography use cipher algorithm for encryption and decryption of data. In the previous decades they were used ciphers like Scytale Vehicles Cipher, Caesar Substitution Chiper, Zodiac Chiper and Vigenere Polyalphabetic Substitution.
Both Steganography and Cryptography are data security techniques, but the cryptography is put in place to data unread and Steganography set for data unseen. Steganography may use Cryptography while Cryptography cannot use Steganography. Steganography implemented to Cryptographic data increase in security level.
Initial Results:
In this software i am implementing three tiers of security to help make the information more secure. There are no any tools that employing all the three levels like compression, Cryptography and Steganograpy. We have tools for steganography like S-Tool as well as for Cryptography. Through the use of one tool instead of using three tools will save time and money with an increase of security. This is actually the basic benefit of this application. The assistance document will guide in Program.
OUT LINE OF PROPOSAL
Aims of the Exploration:
The goal of this newspaper is to describe a way for integrating alongside one another cryptography and Steganography for secure communication utilizing a Video document. The proposed system first compresses the secret meaning (i. e. term document) and then implements cryptographic algorithms to the compressed subject matter. The resulted data file is utilized as the secret communication to be covered in the digital video tutorial file. Once the video record is inserted with the secret communication, it is delivered to the intended recipient. The video document should be de-embedded, decrypted and decompressed to get the original secret concept hence, adding three tiers of security to the communication. I will design a good Graphical User Interface (GUI) with help records so that anyone can understand ahout the application form easily.
Research Targets:
The objective of this project is to cover up secret information (e. g. Text message Phrase, word doc) inside other harmless communications such as Image and Video tutorial file, in a manner that will not allow any alternative party to even discover that there surely is a second key message present in it. The application form implements this by merging the Steganographic methods with Cryptographic techniques (i. e. Encryption, decryption) to make the transfer more secure. It is worried about embedding information in a secure and strong manner. The Text document will be compressed and from then on the compressed file will go on with a Cryptography and Steganography.
Methodologies:
Modules of the application form: The application form has two settings of procedure i. e. Sender and Receiver.
The three major modules for Sender setting of request are
- Compression: The application form first compresses the report to be transferred
- Encryption: An Encryption algorithm encrypts the compressed file and the resulted record is employed as secret note.
- Embedding: The encrypted record is covered in the Harmless Meaning (video record) using equivalent Steganographic algorithm, which produces a Stego Object, which is delivered to the intended recipient.
The three major modules for the Receiver mode of request are
- De-Embedding: The Stego Subject is de-embedded creating an encrypted document.
- Decryption: The encrypted data file is decrypted using an the Encryption algorithm, and the resulted document is given to the compression module
- De-Compression: The application then de-compresses the record and we have the Secret message.
Steganography and cryptography are meticulously related. "Cryptography scrambles information so they can not be recognized" Whereas, "Steganography will cover the note so there is absolutely no understanding of the presence of the concept" [7]. Mailing an encrypted message will arouse suspicion while a low profile message won't do so. The application form developed in this task combines both sciences to create better safety of the concept. Even if the Steganography fails since the message is within encrypted form it is of no use for the third party, hence the info is secure.
In Cryptography we've used three types of methodologies and are executed depending on encryption Algorithm. They are simply Magic formula key Cryptography, Community key Cryptography and hash function. These 3 methods are briefly described below.
Secret Key Cryptography:
Secret key Cryptography, also known as symmetric encryption uses same key for encryption and decryption. The sender uses key to encrypt the written text and transmits ciphertext to the device. The receiver can be applied the same key to decrypt the message and recover the written text.
K K
Text Ciphertext Text
E( ) D( )
K-key, E-Encryption, D-Decryption
Secret key Cryptography
The above amount shows the procedure of hidden knowledge key cryptography. The biggest difficulty with this process is the circulation of the main element. Stop ciphers can operate in one of the several settings. Electronic Codebook (ECB), Cipher Stop Chaining (CBC), Cipher Feedback (CFB), Output Feedback (OFB) are the most crucial modes. Data Encryption Standard (DES), Advanced Encryption Standard (AES), CAST-128/256, Rivest Ciphers (aka Ron's Code), Blowfish are some of the Secret key cryptography algorithms [3].
Public-Key Cryptography:
K1 K2
Text Ciphertext Text
E( ) D( )
K-key, E-Encryption, D-Decryption
Public key Cryptography
Public key cryptography is a two-key cryptography system where two keys are being used in encryption and decryption for secure communication and never have to share a key key. One key is employed to encrypt the text, designated the general public key that can be advertised. The other key is used to decrypt the ciphertext to plaintext and is specified the private key which is never revealed to another get together. This approach also known as as asymmetric cryptography, because we use a pair of keys. The number shows the procedure of the public cryptographic algorithms. Public key cryptography will depend on upon the one-way functions, which can be 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, will be the examples of Public-key cryptography algorithms [3].
Hash Functions:
Hash functions, are also called as meaning digests and one-way encryption. Hash function algorithms do not use an integral to handle the encryption and decryption process. Instead, the algorithm computes a set size hash value established upon the text that keeps both the contents and the length of the concept secure.
Tiny Encryption Algorithm is a Feistel cipher encryption algorithm that uses operations from blended orthogonal algebraic groups like XOR, ADD and Switch. David Wheeler and Roger Needham of the Cambridge School Computer Lab designed TEA in the entire year 1994.
A Feistel cipher is a block cipher with a structure known as a Feistel network. Inside a Feistel cipher, the data been encrypted is split into two halves. The function F( ) is applied to one half by using a sub key and the end result of F() is XORed with the other half and both halves are swapped. Each spherical function uses the same style except for previous round. A nice feature of your Feistel cipher is the fact encryption and decryption are equivalent i. e. the sub keys used during encryption at each circular are taken in change order while decryption [4].
The definitive goal of TEA is to reduce recollection footprint and boost speed. TEA is easy to use, has less execution time, and needs minimal storage space. TEA uses a sizable amount of iterations rather than complicated program.
Notation: Any number subscripted with "h" represents a Hexadecimal number
e. g: 10h represents 16 in decimal principles.
Notations for Bitwise Shifts and Rotations:
x << y: denotes logical still left switch of x by y parts.
x >> y: denotes logical right switch of x by y pieces.
x <<< y: denotes left rotation of x by y bits.
x >>> y: denotes right rotation of x by y parts.
XOR:
In computer knowledge, an XOR is a numerical operation that combines two pieces. It returns value holds true if either of both bits is TRUE, but bogus if both are equivalent. For our cryptography algorithm, we do an XOR merging two strings of parts. Say x and y are two string habits then XOR for x and y is denoted by x y [4].
Integer Addition and Subtraction:
The operation of integer addition modulo 2n is denoted by and subtraction modulo 2n is denoted by. Where x, y Л†Л† Z2n (The worthiness of n should be clear from the framework)
The key is set at 128 bits and the main element timetable algorithm splits the 128-tad key K into four 32-tad blocks K = ( K[0], K[1], K[2], K[3]). The 128-little bit key will do to prevent simple search techniques being effective [4].
Encryption Program:
The Encrypt Regime given in figure [4], is written in the C dialect and assumes a 32-bit expression size. The 128 bit key is put into four parts and is stored in K[0] - k[3] and the info is stored in v[0] and v[1].
void code(long* v, long* k)
unsigned long y=v[0], z=v[1], sum=0, /* set up */
delta=0x9e3779b9, /* a key schedule constant */
n=32 ;
while (n-->0) /* basic cycle start */
sum += delta ;
y += ((z<<4)+k[0]) ^ (z+amount) ^ ((z>>5)+k[1]) ;
z += ((y<<4)+k[2]) ^ (y+amount) ^ ((y>>5)+k[3]) ;
/* end cycle */
v[0]=y ; v[1]=z ;
Encryption Routine for TEA
The frequent delta is given as delta = (Л†5 -1) * 231 i. e. 9E3779B9h and is derived from the golden quantity percentage to ensure that the sub secrets are distinct and its precise value does not have any cryptographic significance.
TEA uses addition and subtraction as the reversible providers instead of XOR. The TEA encryption regimen depends on the alternative use of XOR and ADD to provide nonlinearity. The algorithm has 32 cycles (64 rounds). TEA is brief enough to create into nearly every program on any computer. TEA on one implementation is three times as fast as a good software implementation of DES, which has 16 rounds. The physique shown below [4], offers an overview of two rounds i. e. one cycle of TEA.
Key size: 128 bit key is split into four subkeys K = K[0], K[1], K[2], K[3]
Block size: 64 bits
Structure: Feistel Network
Rounds: Adjustable (64 Feistel rounds (32 cycles) is preferred).
.
Represents Integer addition modulo
Represents XOR
Represents logical kept move by 4 bits
Represents rational right transfer by 5 bits
Two Feistel Rounds (one cycle) of TEA
Inputs for the Encryption program: Plaintext P, Key K
The plaintext is split into two halves as P= (Left[0], Right[0])
Output for the Encryption regimen: The cipher content material is C
Where C=(Remaining[64], Right[64]).
The plaintext stop is put into two halves, Remaining[0] and Right[0] and each 50 percent is employed to encrypt the other half over 64 rounds of processing then combined to produce the cipher text message block. Each round i has inputs Still left[i-1] and Right[i-1], derived from the previous circular, as well as a sub key K[i] derived from the 128 bit overall K.
The Productivity and the delta regular of the ith pattern of TEA receive as
Left [i+1] = Left[i]
F ( Right[i], K [0, 1], delta[i] ),
Right [i +1] = Right[i]
F ( Right[i +1], K [2, 3], delta[i] ),
delta[i] = (i +1)/2 * delta,
The sub secrets K[i] will vary from K and from each other.
The Round function F provides the key addition, bitwise XOR and both remaining and right shift operations, and given as
F(M, K[j, k], delta[i] ) = ((M << 4) K[j]) (M delta[i] ) ((M >> 5) K[k])
F - Round function and K[i] - key for the i'th round
Encryption Process for TEA
The secrets K[0] and K[1] are being used in the strange rounds and the secrets K[2] and K[3] are used in even rounds. The circular function of TEA encryption algorithm differs just a little from a traditional Feistel cipher framework where integer addition modulo-2 can be used rather than XOR as the blending operator. The aforementioned figure[4] gives a synopsis of the encryption process for TEA.
Decryption Program:
void decode(long* v, long* k)
unsigned long n = 32, total, y = v[0], z = v[1],
delta = 0x9e3779b9 ;
sum = delta<
/* start circuit */
while (n-->0)
z - = (y<<4)+k[2] ^ y+total ^ (y>>5)+k[3] ;
y -= (z<<4)+k[0] ^ z+amount ^ (z>>5)+k[1] ;
sum -= delta ;
/* end pattern */
v[0] = y ; v[1] = z ;
Decryption Regime for TEA
The decryption routine shown in the physique[4], is same as the encryption routine with the cipher content material as type and the sub secrets K[i] are used in the change order.
Inputs for the Decryption workout: Cipher words C, Key K
The cipher word is put into two halves as C= (DLeft[0], DRight[0])
Where Dleft[0]=ERight[64] and DRight[0]=Eleft[64]
Output for the Decryption regimen: The basic word is P, Where C=(DLeft[64], DRight[64]).
F - Spherical function and K[i] - key for the ith circular.
Decryption Process for TEA
The physique [4] gives the composition of the decryption algorithm for TEA. The intermediate value for the decryption process equals the related value of the encryption process with the two halves of the worthiness swapped. For example say the outcome of the nth circular of the encryption process is ELeft[i] concatenated with ERight[i] then the type to the (64-i)th decryption round is DRight[i] concatenated with DLeft[i].
DCT-LSB (Discrete Cosine Transformation-List Significant Bit Encoding):
DCT-LSB is a Steganographic method is a substitution algorithm used for covering information behind Video recording files. Each body in the video recording holds an integral part of the secret communication. Discrete Cosine Transform (DCT) changes successive 8 - 8 pixel blocks of the framework into 64 DCT coefficients each. The DCT coefficients D(i, j) of 8 - 8 stop of image pixels p(x, y) are given by the solution below
Least Significant Bit (LSB) is a simple Steganographic method that takes the average person pixels of the framework and replaces minimal significant pieces with the trick message bits. It is the most popular of the coding techniques used. The process of LSB algorithm is shown in the number below.
Embed
Extract
LSB Process
We can commandeer the least significant bit of 8-tad true color image to hold each bit of our secret meaning simply by overwriting the info that had been there. The impact of changing the least significant bit is almost imperceptible.
Input: note, cover image
Output: steganographic subject containing message
while data still left to embed do
get next DCT coefficient from cover file
if DCT 0 and DCT 1 then
get next little bit from the trick message
replace DCT LSB with concept bit
end if
insert DCT into steganographic object
end while
Embedding Procedure for DCT-LSB
Input: steganographic object containing message
Output: message, cover image
while data remaining to extract do
get next DCT coefficient from Stego object
if DCT 0 and DCT 1 then
Extract the DCT LSB little bit from the object
Copy to note file
end if
end while
Extracting Procedure for DCT-LSB
The above results[5] offers algorithms for embedding and extracting key information in training video files using DCT-LSB algorithm respectively.
DEFLATE COMPRESSION ALGORITHM
DEFLATE is a no damage compressed data format that compresses data utilizing a mixture of the LZ77 algorithm and Huffman coding.
Independent of CPU type, operating system, data file system, and figure set
Compatible with widely used gzip utility
Worst case 5bytes per 32Kbyte block[6].
Ethical Factors:
There are two possible means of disorders on Steganography (Detection and Destruction) of embedded subject matter. The properties of the data file in which we could covering information will are different when
hiding message into it. The Steganalysis will find it and analyse the stego object.
Steganalysis is the strategy used to discover hidden text messages in digital data like training video or audio file steganographically[7]. Steganalysis is utilized to disrupt the steganographic elements to copy by extracting, disabling or disrupting.
Detection: Most Steganographic techniques entail in changing the properties of original harmless communications like Image and Video tutorial data and the diagnosis algorithms concentrate on detecting these changes [8]. Detecting the lifestyle of a concealed message will save time in the message elimination phase by processing only those digital files that contains hidden information. Discovering an embedded note defeats the principal goal of Steganography techniques that is concealing the existence of a note [8]. The algorithms range in their methods for hiding information. Without knowing which algorithm is employed and which Stego-key is used, detecting the concealed information is quite sophisticated.
Destruction or Defeating algorithms concentrate on removing the hidden communications from the Stego object [8].
Steganalysis techniques act like the cryptanalysis for the cryptography methods.
As we have discussed previously.
Harmless Subject matter + secret concept + stego-key = stega-object
Some of the known problems for the Steganography are stego-only, known cover, known message, chosen stego, and chosen note.
In Cryptography there are various kinds of Cryptographic episodes. The episodes are done on the Cipher word. There are some of the ways to assault cipher text message like Brute force attacks, Meet in the middle attack, Birthday episode and side channel attack[9].
Plan & Time Desk:
Activity
Nov '09
Dec'09
Dec'09
Dec'09
Jan
09
Jan
09
Jan 09
Jan
09
Feb 09
Selection of topic
XX
analyzing
XX
Research
XX
Literature review
XX
introduction
XX
Rationale
XX
methodologies
XX
Initial results
XX
conclusion
XX
After the authorization of the research proposal the task will be started. The dissertation will be preceded according to the steps that receive by the supervisor.
Limitations and Opportunity:
Steganography is a highly effective way to obscure data and hide sensitive information. The effectiveness of Steganography is amplified by combining it with cryptography. Utilizing the properties of the DCT-LSB Steganography algorithm for video tutorial file and combining it with the TEA cryptography standards, we developed a way, which adds tiers of security to the communication. Steganographic methods do not designed to replace cryptography but dietary supplement it.
The strength of our bodies resides in adding multiple layers of security. First the trick subject matter i. e. word report to be moved is compressed, encrypted and then inserted in a video tutorial data file using Steganographic algorithm hence, adding three levels of security. The weakness of the machine developed is the size of the secret file i. e. term record after compression should be significantly less than the size of the Cover object i. e. Video file. Since we are using compression algorithm this happens limited to huge documents.
As future work, we intend to study more steganalytic techniques i. e. detecting whether a specific file is made up of any form of embedding or not. We also intend to extend our system so that it can hide digital files in other digital files, for example hiding Audio files in Videos files etc.
Personal Development and Necessity:
Regarding this research a brief knowledge on steganography and cryptography and the techniques that are being used in embedding and de-embedding record. We should also have a brief idea on encryption and decryption algorithms in cryptography. In this particular request we can also encrypt strings and document files.
Resource reruirements:
This Application will work on any Microsoft Operating systems and the hard disk should have atleast of 4 MB memory space. The Ram memory should be 256 Mega Bytes or more.
