Question: JAVA One system of steganography is Least Significant Bit Insertion which hides information by manipulating the least significant bit of bytes. The file binary.txt contains

JAVA

One system of steganography is "Least Significant Bit Insertion" which hides information by manipulating the least significant bit of bytes.

The file binary.txtJAVA One system of steganography is "Least Significant Bit Insertion" which hides contains 800 lines representing bytes (one byte per line, each bit represented by a 0 or 1). You are to write a program (name your file lsbi_yourInitials.java) that will isolate the least significant bit on each line of the file binary.txtinformation by manipulating the least significant bit of bytes. The file binary.txt and write those bits, eight per line, to a new file (name the file stage.txt)

MY ORIGINAL INSTRUCTIONS WERE IN ERROR, THE OUTPUT FILE SHOULD BE BELOW:

Given the input file above the lines of the output file would be:

11011011 01100001 10001100 11011111 10001001 11011101 01001101 00101111 00001100 01001101 00010111 00000110 0100

Binary.txt:

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

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!