One of the main techniques for covering computerized data is watermarking, which might be utilized with encryption to expand the security of advanced information. LSB replacement is regularly utilized on the cover picture in picture watermarking systems to disguise the secret watermark. In this work, a special technique in view of symmetric key cryptography and spot pair matching is advanced. Sets of pixels are utilized to arrange the first picture's pixels and the watermark's scrambled pixels. Following the suggested algorithm, the pixel bits are represented in pairs. Then, the scrambled watermark's pixel bit matches are contrasted with the first picture's all's piece matches, and as needs be, the piece matches are supplanted with the relating matched pair's relegated number parallel same. On the off chance that no match is identified, supplant the two LSB with the worth of pair number 0, then, at that point, supplant the 0th pair with watermark bits. The recommended procedure displays great watermarked picture quality, great PSNR values, and great payload. The recommended procedure shows the valuable outcomes by contrasting the results and a few as of now being used calculations.

Cryptography, watermarking, least important bit Bit pair matching and similarity.