Employing Algebraic Eigenvalue Decomposition in Zero Watermarking Technology

The new watermarking technology is highly sophisticated, utilizing advanced algorithms to ensure robust protection and seamless integration with digital content while maintaining the highest levels of security against potential attacks. The primary goal of this paper is to enhance the zero watermarking technology by leveraging the eigenvalue decomposition (EVD) method as an algebraic transformation, without relying on other common transforms. The image matrix is divided into 4x4 blocks, and EVD is applied to each block to extract feature matrix bits, forming the final zero-secret. The robustness of the proposed algorithm is evaluated, showing robust resilience to conventional attacks like noise, filtering, JPEG compression, and cropping, as indicated by the normalized correlation (NC) values.