Abstract

A steganographic technique inspired by rook is presented in this paper to ensure privacy and secrecy. In this approach, the cover image is partitioned into n × 1 pixel blocks and converted equivalent n × 8 binary bit planes. Then the functional output of each block is calculated on the basis of the number of rook positions, which are attacked by opponent rooks. The rook is a chess piece that moves only forward and backward in a straight line. In binary bit plane, 0 and 1 are considered as a black and white opponent rook, respectively. The secret information is considered as stream of binary bits. The binary bits of secret information are compared with the functional output of the corresponding block. If it is equal to the functional output of the corresponding block, then nothing needs to be done. In case of inequality, the small number of bits needs to be flipped in such a way that the functional output of the corresponding block becomes equal to the corresponding secret binary bits and the distortion of the cover is minimized.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call