M.ABHISHEK VENKATESH.M MADHU BHARADAJ PRABHAVA Mr.

M N Jayaram
Mr. C R Nataraj

(4JC09EC046) (4JC09EC047) (4JC09EC050) (4JC09EC065)

Mrs.B S Renuka

Steganography is the dark cousin of cryptography, the use of codes. While cryptography provides privacy, steganography is intended to provide secrecy - irBryan Clair The Right to privacyis the most comprehensive of rights and the right most valued by civilized man. -Justice Louis US Supreme Court, 1928.

Clandestine Communication
Cryptography
Steganography
Scrambles the message into cipher Hides the message in unexpected places

Digital Applications of Steganography

Can be hidden in digital data
Digital images (bmp, gif, jpg) Web pages (htm) Executables (exe) Sound files (mp3, wav, cda) Video files (mpeg, avi) Ms word doc

Steganography is the art and science of hiding messages in such a way that no one, apart from the sender and intended recipient, suspects the existence of the message, a form of security through obscurity. Art traced back to 440 BC. finds use in various military, diplomatic, personal and intellectual property applications.

The word steganography comes from the Greek Steganos, which means covered or secret and graphy means writing or drawing. Therefore, steganography literally means covered writing. The main goal of this project is to communicate securely in a completely undetectable manner and to avoid drawing suspicion to the transmission of the hidden data.

Message is the data that the sender wants to send in a hidden manner A stego-key which ensures that only the recipient who knows the corresponding decoding key will be able to extract the message from a cover-object. The cover-object with the secretly embedded message is then called the Stego-object. Recovering message from a stego-object requires the cover-object itself and a corresponding decoding key

The Modus Operandi we have adopted is :use an image to hide the message in its pixels . Message could be any set of strings Mostly we prefer PASSWORDS that are of 20-35 characters(Our Application Supports a max of 1023 characters) This process encodes the image file with the message to be hidden, which later is decoded at the receivers side.

Uncompressed Images 256 shades of intensity from black to Character white Integer Binary Space 32 00100000 Arranged into a 2-D matrix 09 48 57 00110000 - 00111001 Messages are hidden in the least AZ 65 90 01000001 - 01011010 significant bits (lsb) az 97 122 01100001 01111010 Matrix values change slightly

In LSB technique the least significant bit is used to store the message i.e a total of 8 pixels may be modified to store a character When using a 24-bit image, a bit of each of the red, green and blue colour components can be used, since they are each represented by a byte. In other words, one can store 3 bits in each pixel.

A grid for 3 pixels of a 24-bit image can be as follows: (00101101 00011100 11011100) (10100110 11000100 00001100) (11010010 10101101 01100011) When the number 200, which binary representation is 11001000, is embedded into the least significant bits of this part of the image, the resulting grid is as follows: (00101101 00011101 11011100) (10100110 11000101 00001100) (11010010 10101100 01100011)

These changes cannot be perceived by the human eye - thus the message is successfully hidden and it results in small changes in the intensity levels only. With a well-chosen image, one can even hide the message in the least as well as second to least significant bit and still not see the difference.

The simplicity of the BMP file format, and its widespread familiarity in Windows and elsewhere, as well as the fact that this format is relatively well documented and free of patents, makes it a very common format for image processing programs. It is a type of memory organization or image file format used to store digital images. The term bitmap comes from the computer programming terminology, meaning just a map of bits, a spatially mapped array of bits.

Here actually, the 7th and 8th bit of the pixels are being replaced by the message bits(taken 2 at a time.).

The proposed method hides the secret message based on searching about the identical values between the secret message and image pixels. Here we hide two by two bits of the secret message in each pixel by searching for identical bits. if the identical is satisfied then no changes are required otherwise it is stored in the 7th and 8th bits Finally the location where the bits are hidden is saved.

+
IMAGE FILE

MESSAGE TO BE HIDDEN

BMP FILE(encoded)

In the encryption phase data is embedded into the image using our proposed algorithm by which we hide two by two bits of the secret message in each pixel by searching about the identical bits ,if the identical is satisfied then no changes are made otherwise it is hidden in the two least significant bits and the pixel values are updated Also a key is used to determine the position where the message could be embedded.

We have further enhanced the security by incorporating RSA algorithm and CRC in our Application RSA's biggest advantage is that it uses Public Key encryption. However, only the person it is intended for can read it, by using their private key . The technique of using a cyclic redundancy check, or CRC, in computing serves the purpose of detecting data transmission errors.

The RSA Algorithm is named after the three people who developed it back in 1978: Ron Rivest, Adi Shamir, and Leonard Adleman Procedure for Encryption using RSA Algorithm

Choose two prime numbers, p and q. Get the product, n, of the two numbers (n = pq). Get the quotiet, r, of p and q (r = (p - 1)(q - 1)). Get a number, e, that is less than r and shares no prime factors with r other than 1. Get another number, d, so that de - 1 = rk where rk equals any multiple of r that will fulfill the equation

Having the numbers p, q, n, r, e, and d, we create a public key and a private key. The public key is (e, n) and the private key is (d, n), which is kept secret. If someone wants to send you an encrypted message using a predetermined characterto-number mapping system, they would look up to the public key and encrypt their message . Convert each of the message's character into its mapped number, m, and have its encrypted equivalent, c, be equal to me mod n. (a mod b is equal to the remainder of a b). To decrypt the message, use the private key and put the encrypted number, c, through m = cd mod n to get the original character.

A CRC-enabled device uses a short, fixed-length binary sequence, known as the check value or CRC, for data to be sent and appends it to the data, forming a codeword. If codeword is received , the device either compares its check value with one freshly calculated from the data block, or equivalently, performs a CRC on the whole codeword and compares the resulting check value with an expected residue constant. If the check values do not match, then the block contains a data error. The device may take corrective action, such as rereading the block or requesting that it be sent again or else, the data is assumed to be error-free.

The Decryption phase is reverse to encryption phase. Carrier image in which the data is hided is given as an input file. Uses the same key which was given for the encryption in order to secure from unauthorized access. After giving the correct key ,the decryption section uses the proposed algorithm by which the encoded bits in the image is decoded and turns to its original state and gives the output as a text document as well as image

BMP FILE(encoded)

INFORMATION MESSAGE

MATLAB Its unique features are : Quick and Robust Access to implementation details Numerical accuracy Support for advanced algorithms Tools for enhancement of a program(GUI)

Storing passwords and/or other confidential information Covert communication of sensitive data

Speculated uses in terrorist activities Being widely used to hide and/or transfer illegal content

Access control system for digital content distribution Confidential communication and secret data storing Protection of data alteration Media Database systems Usage in Modern printers

Amirthanjan,R. Akila,R&Deepikachowdavarapu, P., 2010. A Comparative Analysis of Image Steganography, International Journal of Computer Application, 2(3), pp.2-10. Johnson, N.F. Jajodia, S., 1998. Exploring Steganography: seeing the unseencomputing practices, IEEE journal, Vol 1. Krenn, J.R., 2004. Steganography and Steganalysis. IEEE communication magazine. Provos, N. & Honeyman,P.,2003. Hide and seek: an introduction to steganography. IEEE computer society. www.scribd.com/doc/... /Internet & Technology