Distribution Key in Eight Bit's Color Image Algorithm

Problem statement: The networked multimedia systems have glorified the necessity for image copyright protection. To solve such problem an invisible structure called watermarking is added to an 8-bits color image in aim to mark it. The structure can be added by selecting bits under certain conditions; a few pixels of correspondence between the image and the ASSCI code. Approach: In this study, we employed a robust image-watermarking algorithm using the Key Distribution Algorithm to hide data inside 8-bits color image as a watermark. Results: Experimental results show that, Similarity in the embedding process making the selection bits from the image and did not make any change in the pixels, Entropy become equal zero where no changes in the existed pixels and the selected keys chosen from pixels which distributed in image, where does not exist any changed on cover image so any updating on image doesn’t mean anything, so the key of the owner cannot be known. Conclusion: By applying Key Distribution algorithm the watermark can be extracted at low error rate.