IMPLEMENTATION OF BPCS-STEGANOGRAPHY

(Synopsis)

ABSTRACT
IMPLEMENTATION OF BPCS-STEGANOGRAPHY Steganography is a technique to hide secret information in some other data (we call it a vessel) without leaving any apparent evidence of data alteration. All of the traditional steganographic techniques have limited information-hiding capacity. They can hide only 10% (or less) of the data amounts of the vessel. This is because the principle of those techniques was either to replace a special part of the frequency components of the vessel image, or to replace all the least significant bits of a multivalued image with the secret information. Our new Steganography uses an image as the vessel data, and we embed secret information in the bit-planes of the vessel. This technique makes use of the characteristics of the human vision system whereby a human cannot perceive any shape information in a very complicated binary pattern. We can replace all of the noise-like regions in the bit-planes of the vessel image with secret data without deteriorating the image quality. We termed our Steganography BPCSSteganography, which stands for Bit-Plane Complexity Segmentation Steganography.

INTRODUCTION
1.1 INTRODUCTION TO THE AREA

Internet communication has become an integral part of the Infrastructure of todays world. The information communicated comes in numerous forms and is used in many applications. In a large number of these applications, it is desired that the communication be done in secrete. Such secret communication ranges from the obvious cases of bank transfers, corporate communications, and credit card purchases, on down to a large percentage o f everyday email. With email, many people wrongly assume that their communication is safe because it is just a small piece of an enormous amount of data being sent worldwide. After all, who is going to see it? But in reality, the Internet is not a secure medium, and there are programs out there which just sit and watch messages go by for interesting information. Encryption provides an obvious approach to information security, and encryption programs are readily available. However, encryption clearly marks a message as containing interesting information, and the encrypted message becomes subject to attack. Furthermore, in many cases it is desirable to send information without anyone even noticing that information has been sent secret information. Some of them use the least significant bits of the image data to hide the data. Other programs embed the secret information in a Steganography presents another approach to information security. In steganography, data is hidden inside a vessel or container that looks like it contains only something else. A variety of vessels are possible, such as digital images, sound clips, and even executable files. In recent years, several steganographic programs have been posted on Internet home pages. Most of them use image data for the

container of the specific band of the spatial frequency component of the carrier Some other programs make use of the sampling error in image digitization. However, all those steganographic techniques are limited in terms of information hiding capacity. They can embed only 5-15 % of the vessel image at the best. Therefore, current steganography is more oriented to water marking of computer data than to secret person-person communication applications. We have invented a new technique to hide secret information in a color image. This is not based on a programming technique, but is based on the property of human vision system. Its information hiding capacity can be as large as 50% of the original image data. This could open new Applications for steganography leading to a more secure Internet Communication age. Digital images are categorized as either binary (black-andwhite) or multi-valued pictures despite their actual color. We can decompose an n-bit image into a set of n binary images by bit-slicing operations [1][2]. Therefore, binary image analysis is essential to all digital image processing. Bit slicing is not necessarily the best in the Pure-Binary Coding system (PBC), but in some cases the Canonical Gray Coding system (CGC) is much better [3].

TECHNOLOGIES
This project has been developed to work all in SUN platforms for the client side and it needs APPLET as the server side platform. We have used JAVA coding AWT and Swing components and we have implemented these components in JAVA. The windows API calls are mainly used in all objects to get required systems files.

SECURITY CONSIDERATIONS
THE RSA ALGORITHM INTRODUCTION: The RSA scheme is a block cipher in which the plaintext and cipher text are integers between 0 and n-1 for some n.A typical size for n is 1024 bits or 309 decimal digits. The RSA scheme has since that time reigned supreme as the most widely accepted and implemented general purpose to public key encryption. DESCRIPTION: The scheme developed by Rivest, Shamir and Adleman makes use of an expression with exponentials. Plaintext is encrypted in blocks, with each block having a binary value less than some number n.That is, the block size must be less than or equal to log2(n) ; in practice, the block size is k bits, where 2 k < plaintext block M and cipher text block C: C = Me mod n M = Cd mod n = (Me)
d

n < 2k+1

.Encryption and decryption are of the following form, for some

mod n = Med mod n

Both sender and receiver must know the value of n.The sender knows the value of e and only the receiver knows the value of d.Thus, this is a public key encryption algorithm with a public key of KU = {d,n}. For this algorithm to be satisfactory for public key encryption, the following requirements to be met : 1. It is possible to find the values of e, d, n such that M ed = M mod n for all M < n. 2. It is relatively easy to calculate Me and Cd for all values of M < n. 3. It is infeasible to determine d given e and n. For now,we focus on the first requirement and consider the other questions later.We need to find a relationship of the form Med = M mod n Given two prime numbers and q, and two integers and m, such that n=pq and 0<m<n, and arbitrary integer k, the following relationships holds: Mk (n)+1 = mk(p-1)(q-1)+1 = m mod n Where (n) is the eulers totient function, which is the number of positive integers less than n and relatively prime to n. it is shown that for p,q prime, (p,q)=(p-1)(q-1). Thus we can achieve the desired relationship if ed = k(n)+1 This is equivalent to saying:

ed = 1 mod (n) d = e-1 mod (n) That is, e and d are multiplicative inverses mod (n). Note that, according to the rules of modular arithmetic, this is true only if d (and therefore e) is relatively prime to (n). Equivalently, gcd ((n),d) = 1. We are now ready to state the rsa scheme.the ingredients are the following: P, q, two prime numbers chosen) n = pq calculated) e, with gcd((n),e) = 1; 1< e < (n) chosen) d = e-1mod (n) calculated) (private, (public, (public, (private,

The private key consist of {d,n} and the public key consists of {e,n}.suppose that user a has published its public key and that user b wishes to send the message M to A. then b calculates C = M e (mod n) and transmits C. on receipt of this cipher text, user a decrypts by calculating M = Cd (mod n). It is worthwhile to summarize the justification for this algorithm. We have chosen e and d such that d = e-1 mod (n)

Therefore, Ed = 1 mod (n) Therefore,ed is of the form k(n)+1 So M

ed

= mod n .Now C = Me mod n M = Cd mod n = (Me)d mod n = M mod n

The keys were generated as follows: 1. Select two prime numbers p and q 2. Calculate n = pq 3. Calculate (n) = (p-1) (q-1) 4. Select e such that e is relatively prime to (n) and less than (n) 5. Determine d such that de = 1 mod (n) KEY GENERATION Before the application of the public key cryptosystem, each participant must generate a pair of keys. This involves the following tasks: 1. Determining two prime numbers, p and q 2. Selecting either e or d and calculating the other The procedure for picking a prime number is as follows: 1. Pick an odd integer n at random 2. Pick an integer a < n at random 3. Perform the probabilistic primarily test, such as Miller Rabin. If n fails the test, reject the value n and go to step 1.

4. If n has passed a sufficient number of tests, accept n; otherwise, go to step

THE SECURITY OF RSA Three possible approaches to attacking the RSA algorithm are as follows : 1. Brute force: This involves trying all possible private keys. 2. Mathematical attacks: There are several approaches, all equivalent in effect to factoring the product of two primes 3. Timing attacks: These depend on the running time of the decryption algorithm.

DESIGN ISSUES
1. EMBEDDING CAPACITY We have developed BPCS-Steganography programs for both Windows and Unix. In each program, we took an 8 8 square as the local image size. Fig. 4 (A) is an example of the original dummy image (640x588, full color). (B) is the same image with all the information of Fig. 5 embedded in it. As indicated in Fig. 5 this embedded information includes a picture of Lincoln, the text from four historical documents, and the entire script from seven of Shakespeares plays. Note that the size of the embedded information before compression is almost as great as the image size itself. Furthermore, the

embedding operation does not increase the size of the image by even a single byte. Yet, even when viewed on the computer monitor, the images before and after embedding are almost indistinguishable from one another. It should also be noted that the image of Fig. 4 contains a number of large regions that are relatively flat in color. Our BPCS technique made little use of such regions for embedding, as doing so would introduce noticeable noise in these regions. Fig.6 presents an example of embedding in a scene with few flat regions. In this case the image is 617x504 pixels. (A) shows the original image, and (B) shows the image after embedding all the information of Fig. 5 plus an additional Shakespearean play, Antony and Cleopatra of size 179,900 bytes before compression and 64,184 bytes after. Therefore the total information embedded in this 933,408 byte image is actually 1,212,744 bytes before compression; i.e., the embedded information exceeds the vessel size by 30%.

The compressed data size is 505,502 bytes, which is 54% of the vessel size. Even with this much information embedded in the image, the embedded and original images look nearly identical when viewed on the monitor. (A) Original vessel image (B) Embedded vessel image Fig.4 Example of a vessel image Through our embedding experiments, we found that most color images taken by a digital camera can be used as vessel images. In almost all cases, the information hiding capacity was nearly 50% of the size of each vessel image. This capacity is 4 to 5 times as large as currently known steganographic techniques. For a

given image, embedding capacity can be traded with image quality by altering the complexity threshold. The image of Fig. 4 used a threshold of 24 border pixels per 8 8 region; therefore regions having more border pixels than this were eligible for embedding. Fig. 7 shows how the capacity changes with threshold for this image. For this image a threshold of 24 seemed optimal, while lower thresholds introduced some noise to the image. 2. USING GRAY CODED BIT-PLANES FOR COMPLEXITY SEGMENTATION The advantage to using Gray Coded bit planes for complexity segmentation. Parts A through C of this figure show the PBC red bit planes numbered 3 through 5 for the image of Fig. 5a, while parts D through F show the CGC version of these same planes. From looking at such bit planes, one can get a pretty good idea of which regions of the bit plane are complex enough to be replaced with information during BPCS embedding. Recall that the goal with BPCS Steganography is to use as much of the image as possible for hiding information without appreciably altering the visual appearance of the image. In comparing these two sets of bit planes, it is evident that the PBC bit planes provide a much greater region for embedding. However, substantial portions of the regions on the higher bit planes deemed embeddable using PBC are actually relatively flat in color. For example, note the wall in the background. This is because of the Hamming Cliffs which occur with PBC wherein a small change in color affects many bits of the color value. If embedding were to replace the bits in such complex looking but actually relative flat regions, then substantial color changes would occur. As a simple example, consider a region where the blue value hovers nearly

randomly between the binary values of 01111111 and 10000000. In this region, every bit plane would look complex and would thus appear to be embeddable, while in practice, it would be prudent to only embed in the lower one or two planes. Although occurrences such as this where all bits change in a relatively flat region are rare, the frequency of occurrence doubles on each lower bit plane. 3.CUSTOMIZATION OF THE PROGRAM The BPCS-Steganography algorithm has several embedding parameters for a practical program implementation. Some of them are: (1) The embedding location of the header(s) of the secret file(s) (2) The embedding threshold, 0. (3) The sequence in which the 8 8 regions of the vessel image are considered for embedding. (4) The encoding of the conjugation map. (5) Special operations, such as an exclusive-or of the header bytes or embedded data with pseudo-random numbers. (6) Encryption parameters of the secret file(s) (7) The compression parameters of the secret file(s) It is very easy for a single BPCS Steganography program to allow the user to customize parameters such as these, producing a very large number of possible customized programs. In this way, each user or group of users can have their own program that embeds data in an image in a way that is unreadable by others.

SYSTEM STUDY
2.1 EXISTING WORK
Information send through any network have a chance attack by hackers Encryption provides an obvious approach to information security, and encryption programs are readily available. However, encryption clearly marks a message as containing interesting information, and the encrypted message becomes subject to attack. Furthermore, in many cases it is desirable to send information without anyone even noticing that information has been sent secret information. to

2.2 OBJECTIVE OF THE PROPOSED SYSTEM

The main objective of this system is we never leave any information about something will be hided in that vessel.

2.3 PROPOSED SYSTEM

In Steganography, data is hidden inside a vessel or container that looks like it contains only something else. A variety of vessels are possible, such as digital images, sound clips, and even executable files. All of the traditional steganographic techniques have limited information-hiding capacity. They can hide only 10% (or less) of the data amounts of the vessel.

This Technique uses an image as the vessel data, and we embed secret information in the bit-planes of the vessel. We can replace all of the noise-like regions in the bit-planes of the vessel image with secret data without deteriorating the image quality We termed our Steganography BPCS-Steganography, which stands for Bit-Plane Complexity Segmentation Steganography

PROPOSED SYSTEM MODULES

Hider File Segmentation (8 X 8) Noise Level Identifier Complexity Identifier Gray Converter Noisy level Revalidator Secret File Segmentor Text & Image bits replacer Image Reproducer Retriever Image Scanner Image Segmentor (8 x 8) Complex Plan Identifier Information Retriever Process State Identifier

REQUIREMENTS ANALYSIS AND SPECIFICATION

3.1 HARDWARE REQUIREMENTS
Processor Processor Speed Memory Size Hard Disk Drive : : : : Pentium Celeron 850 MHZ 128MB 40GB

3.2 SOFTWARE REQUIREMENTS

Operating System Front End : Windows 98/2000/NT : JAVA 1.5.0

MODULE DESCRIPTION

HIDER

1. Load Image

2. Load Source 3. Choose Encryption Keys 4. File Compressor 5. Image Analyzer 6.File Hider

RETRIEVER 1. Choose Embedded Image 2. Choose Text File / Directory

3. File Extractor

4. Content Displayer

BPCS
1. Load Image 2. Load Source 3. Choose Encryption Keys 4. File Compressor 4. Content Displayer 1. Choose Embedded Image 2. Choose Text File / Directory 3. File Extractor

6.File Hider

CONCLUSION
SUMMARY
The objective of this paper was to demonstrate our BPCSSteganography, which is based on a property of the human visual system. The most important point for this technique is that humans cannot see any information in the bit-planes of a color image if it is very complex. We have discussed the following points and showed our experiments. (1) We can categorize the bit-planes of a natural image as informative areas and noise-like areas by the complexity thresholding. (2) Humans see informative information only in a very simple binary pattern. (3) We can replace complex regions with secret information in the bit-planes of a natural image without changing the image quality. This leads to our BPCS-Steganography. (4) Gray coding provides a better means of identifying which regions of the higher bit planes can be embedded. (5) A BPCS-Steganography program can be customized for each user. Thus it guarantees secret Internet communication. We are very convinced that this steganography is a very strong information security technique, especially when combined with encrypted embedded data. . Furthermore, it can be applied to areas other than secret communication. Future research will include the application to vessels

other than 24-bit images, identifying and formalizing the customization parameters, and developing new applications.