Skip to main content

Steganography | Method to hide a file in another file | Transferring data secretly (Windows And Linux)

Steganography

Steganography is the technique of hiding secret data within an ordinary, non-secret, file or message in order to avoid detection; the secret data is then extracted at its destination. The use of steganography can be combined with encryption as an extra step for hiding or protecting data.( First Definition of Google Search)


The Basic idea behind Steganography is to combine the binary code of two files and put it into a single file.

Suppose we have two files:
1.Any Image File (Let's name it 'name.jpg')
2.Compress your file to zip format: Let's Name it 'compressed.zip'

Now to put both file in single image 'name.jpg' , we will combine the binary code of both the files.

To do this:

1. Linux:
1.Open Terminal

2.change your working directory to the directory where both files are
3.Run following command

    cat name.jpg compressed.zip > secret.jpg

 4.A new file result.png will have created
5.unzip your image with unzip command to get your files.

     unzip secret.jpg


Note: To Zip files in linux use following command:
zip archive-name.zip filename-1.ext filename-2.ext

To Unzip files in linux use following command:

unzip archive-name.zip 

2. Windows:
1.Open CMD
2.change your working directory to the directory where both files are
3.Run following command

    copy /b name.jpg + compressed.zip name.jpg

    Note: /b is used to copy in binary mode

4.Now your image 'name.jpg' size will have increased.
5.Open your image with zip extractor.
Note: Use WinRAR as zip extractor to avoid facing any issue.





Labels:

Comments

Post a Comment

Popular posts from this blog

What is Kernel Function | Fully Explained

Kernel Function In this post, We'll know what exactly is kernel function. Kernel Function is used to transform n - dimensional input to m- dimensional input , where m is much higher than n then find the dot product in higher dimensional efficiently.It also helps sometimes to do calculation easily in infinite dimensional space without going to infinite dimensions. Mathematical definition :  K(x, y) = <f(x), f(y)> . Here K is the kernel function, x, y are n dimensional inputs. f is a map from n-dimension to m-dimension space. < x,y> denotes the dot product. usually m is much larger than n. Intuition :  Normally calculating <f(x), f(y)> requires us to calculate f(x), f(y) first, and then do the dot product. These two computation steps can be quite expensive as they involve manipulations in m dimensional space, where m can be a large number. But after all the trouble of going to the high dimensional space, the result of the dot product is really a ...
Post a Comment
Read more

Linear Regression(With Gradient Descent ) Fully Explained| Machine Learning

Linear Regression (Gradient Descent Method) If you don't have any idea of Gradient Descent Algorithm , please check our previous post , there I have explained Gradient Descent Algorithm very well explained in brief. Now moving toward our current topic Linear Regression . In the previous post , we have just discussed the theory behind the Gradient Descent . Today we will learn Linear Regression where we will use  Gradient Descent to minimize the cost function. WHAT IS LINEAR REGRESSION: Suppose you are given a equation: y=2x1+3x2+4x3+1 and you are said to find the value at any point (1,1,1) corresponds to x1, x2, x3 respectively. You'll simply put the value of x1, x2, x3 into equation and tell me the answer :10,Right? But What if you are given different set of (x1, x2, x3,y) and you are said to find the equation. Here's what,Linear Regression Comes into picture.It helps us to find out or fit a Linear equation to datasets  given. Above equation can be easily tra...
Post a Comment
Read more

Gradient Descent Algorithm Fully Explained| Machine Learning

GRADIENT DESCENT ALGORITHM When one start Learning For Machine Learning, As a beginner one founds a very complex explanation of Gradient Descent Algorithm and since it is a very important algorithm in machine Learning,understanding it, is also much important. Today , in this article we will try to understand Gradient Descent   in very easy, brief and well explained way. Gradient Descent  is the most common optimization algorithm in  machine learning  and  deep learning . It is a first-order optimization algorithm. This means it only takes into account the first derivative when performing the updates on the parameters. If we start searching for Gradient Descent Algorithm ,we found this picture. Don't panic! Let me explain you z is a cost function of x and y.We have to find those value of x and y for which value of cost function (z) is minimum. If we visualize it, splitted in two part (z VS x for any fix value of y) and (z VS y for any fix value ...
Post a Comment
Read more