Question: Java Steganography Least Significant Bit Insertion Program The file binary.txt contains 800 lines representing bytes (one byte per line, each bit represented by a 0
Java Steganography "Least Significant Bit Insertion" Program
The file binary.txt contains 800 lines representing bytes (one byte per line, each bit represented by a 0 or 1). Write a Java program that will isolate the least significant bit on each line of the file binary.txt and write those bits, eight per line, to a new file. Here is what is in the binary.txt file:
1 1 0 1 1 0 1 1
1 1 0 0 1 0 0 1
1 1 0 1 1 1 0 0
1 0 1 0 0 0 1 1
0 1 0 0 0 0 0 1
1 1 0 1 0 1 0 0
0 1 1 1 1 0 0 1
1 1 1 0 0 1 1 1
1 1 0 0 0 0 1 0
1 0 0 1 0 0 1 1
1 1 0 1 0 0 1 1
0 0 0 0 0 0 1 0
1 0 1 0 0 0 0 0
0 0 0 0 1 1 1 0
1 0 0 0 1 0 1 0
1 1 1 0 0 1 0 1
1 0 0 0 0 1 1 1
1 1 0 1 0 1 0 0
0 1 1 0 0 0 0 0
0 0 1 1 1 1 1 0
1 0 0 1 0 1 0 1
0 1 1 1 0 1 0 1
0 1 1 1 1 1 0 0
1 0 1 0 1 0 0 0
1 1 0 0 1 0 1 1
1 1 1 0 0 0 1 1
0 0 0 1 1 1 1 0
1 0 0 1 1 1 1 1
1 0 0 1 1 0 0 1
1 0 0 0 0 0 1 1
0 1 1 1 1 1 0 1
1 1 1 0 1 0 1 1
0 0 0 1 0 1 1 1
0 1 0 1 0 1 0 0
0 1 1 1 0 1 1 0
1 0 0 1 1 0 0 0
1 0 0 1 1 1 1 1
1 0 0 1 1 0 0 0
1 1 1 1 1 0 0 0
1 1 0 1 0 0 0 1
0 1 0 0 0 1 1 1
1 1 1 1 0 1 1 1
1 1 1 1 1 0 0 0
0 0 1 0 1 1 1 1
1 1 1 1 1 0 0 1
0 1 0 0 0 0 0 1
1 1 0 1 1 1 1 0
0 0 0 0 1 0 0 1
1 0 0 1 0 1 0 0
0 1 1 1 0 0 0 1
1 0 0 0 0 1 1 0
1 0 0 0 0 0 0 0
0 1 1 0 1 1 1 1
1 0 0 1 0 1 0 1
1 1 0 1 1 1 0 0
0 0 1 0 1 1 1 1
0 1 0 0 1 1 1 0
0 0 0 0 0 0 0 0
0 1 0 0 1 1 0 1
0 0 1 1 0 0 1 0
0 0 1 0 0 0 1 1
0 0 1 1 0 0 1 1
1 1 1 1 1 0 1 1
0 1 1 1 0 0 0 1
0 1 0 0 0 1 1 0
1 1 0 1 0 1 0 0
1 0 0 1 1 1 1 0
1 0 0 0 1 1 0 0
0 0 1 1 0 0 0 1
1 0 1 1 1 0 0 1
0 0 1 1 0 0 1 0
1 1 1 0 0 1 1 0
1 1 1 0 1 1 1 0
1 1 1 1 0 0 1 1
1 1 1 0 1 1 1 0
0 0 0 1 0 1 1 0
0 1 0 0 1 1 0 1
0 0 0 1 1 1 1 1
1 1 0 1 0 0 1 0
1 1 0 1 1 0 0 1
0 1 0 0 0 1 0 0
1 0 1 0 1 0 0 0
1 1 1 0 0 1 0 0
0 1 0 0 0 0 0 1
1 0 0 1 1 1 0 0
1 0 1 0 1 0 0 1
0 0 0 0 1 1 0 1
0 0 1 0 1 1 0 1
0 0 1 0 0 1 1 0
0 1 0 0 1 0 0 0
0 1 1 1 1 0 1 0
0 0 1 0 1 0 0 0
1 0 0 1 0 1 1 0
0 0 0 0 0 1 1 1
1 1 1 1 0 1 0 1
0 0 0 1 0 0 0 0
0 1 1 0 1 0 1 0
1 0 1 1 1 1 1 1
1 0 0 0 1 0 1 0
0 1 1 1 1 1 0 0
Given the input file above the first three lines would be:
0 1 1 0 1 1 0 1 0 0 0 0 1 0 1 1 1 0 1 0 0 1 1 0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
