Blind and Secured Adaptive Digital Image Watermarking Approach for High Imperceptibility and Robustness

. 2021 Dec 8;23(12):1650. doi: 10.3390/e23121650

Algorithm 3 Watermark encryption.

Require:
Watermark (W) of size $P \times Q$
Ensure:
Encrypted watermark vectors $V_{o d d}^{1} a n d V_{e v e n}^{1}$ of size $P \times Q / 2$ , $R_{k e y}$ , $P R_{K e y}$ ( $P \times Q$ /2)
1:
Partition W into even $(V_{e v e n})$ and odd $(V_{o d d})$ position pixel vectors.
2:
Generate 8-bit binary intermediate key $(I K_{B})$ .
3:
Generate 128 bit $R_{k e y}$ by hashing $(I K_{B})$ using MD-5.
4:
Generate $P R_{K e y}$ (( $P \times Q$ )/2) from $R_{k e y}$ using Algorithm 4.
5:
Shuffle $V_{o d d} a n d V_{e v e n}$ using $P R_{K e y}$ to get the encrypted vectors $V_{o d d}^{1} a n d V_{e v e n}^{1}$ .