This ppt is use full for those who are interested in the area of steganography and try to implements it and add some new features and more security to the steganography

1. Steganography
PREPARED BY :- SAGAR KUMAR

2. QUICK INTRODUCTION
 Image Steganography
 Steganography : Messages are covered
 Cryptography : Messages itself are
Encrypted.

3. Project Idea
 To combine two security techniques
1. Cryptography
(For Encryption & Decryption)
2. Steganography
(For Data hiding in a digital image)

4. Crypt-Steganography
Invisible
Encryption Steganography

5. Why to do so ?
 Hiding data is better than moving it shown
and encrypted.
 To hide data in a popular object that will not
attract any attention.
 In case the data is extracted, it will be
encrypted

6. Requirements…
 Algorithm to create cipher text.
(Cryptography)
 Algorithms to embed data into image.
(Steganography)
 Find position of doping

7. Steganography
 Image as a cover object.
 Why “Image”..?
 It can contain enough information to hide,
while not appearing to be modified.
 It is common enough to not attract an y
attention.

8. Steganography Technique
 The least significant bits(LSB):Modifying the
rightmost bit in each byte by replacing it with a
bit from the secret message.
 Why “LSB”..?
 Designed for images that have 3 or 4 bytes
per pixel.

9. Color perception
 Changing the LSB
Of the RED value by 1
(in 24-bit color depth)
Is undetectable by
Human eyes.

10. LSB Example
 A sample raster data for 2 pixels (4 bytes per
pixel.
( 10010101 00001101 11001001 10010110
00001111 11001011 10011111 00010000 )
 Let hide “G” here.
 G=( 01000111)

11. LSB Example Contd.
 New file:
( 10010100 00001101 11001000 10010110
00001110 11001011 10011111 00010001 )
 ONLY HALF OF THE LEAST BITS
CHANGED THE NUMERIC
 VALUE OF EACH BYTE CHANGED VERY
LITTLE

12. Our LSB Approach
 Here we will allow the user to insert data into
the two least significant bit
 It is little bit less secure than simple LSB, because
there will be more modification.
 On the other hand it will double the capacity of
hidden data.

14. Doping position
 Randomization of inserting the secret
message bits into images
 Developed a function that generates a random offset
from the set {2,4,6}, then spreads the message bits
according to that offset.
OR
 Develop a function for “Zigzag” Traverser of pixel
matrix and embed data.

15. Program Sequence
HIDING
• Select a image.
• Enter a message and a
cipher key
• Encrypting message.
• Hiding it in the selected
image
REVEALING
• Select a PNG image (Stego
object).
• Enter the cipher key.
• Extracting encrypted data from the
image.
• Decrypting and showing the
message

16. Conclusion
 Using LSB with some change for
steganography
 Design function for doping position

17. THANK YOU