Recently, diagnosing diseases using medical images became crucial. As these images are transmitted through the network, they need a high level of protection. If the data in these images are liable for unauthorized usage, this may lead to severe problems. There are different methods for securing images. One of the most efficient techniques for securing medical images is encryption. Confusion and diffusion are the two main steps used in encryption algorithms. This paper presents a new encryption algorithm for encrypting both grey and color medical images. A new image splitting technique based on image blocks introduced. Then, the image blocks scrambled using a zigzag pattern, rotation, and random permutation. Then, a chaotic logistic map generates a key to diffuse the scrambled image. The efficiency of our proposed method in encrypting medical images is evaluated using security analysis and time complexity. The security is tested in entropy, histogram differential attacks, correlation coefficient, PSNR, keyspace, and sensitivity. The achieved results show a high-performance security level reached by successful encryption of both grey and color medical images. A comparison with various encryption methods is performed. The proposed encryption algorithm outperformed the recent existing encryption methods in encrypting medical images.

In the age of Information Technology, the day-life required transmitting millions of images between users. Securing these images is essential. Digital image encryption is a well-known technique used in securing image content. In image encryption techniques, digital images are converted into noise images using secret keys, where restoring them to their originals required the same keys. Most image encryption techniques depend on two steps: confusion and diffusion. In this work, a new algorithm presented for image encryption using a hyperchaotic system and Fibonacci Q-matrix. The original image is confused in this algorithm, utilizing randomly generated numbers by the six-dimension hyperchaotic system. Then, the permutated image diffused using the Fibonacci Q-matrix. The proposed image encryption algorithm tested using noise and data cut attacks, histograms, keyspace, and sensitivity. Moreover, the proposed algorithm’s performance compared with several existing algorithms using entropy, correlation coefficients, and robustness against attack. The proposed algorithm achieved an excellent security level and outperformed the existing image encryption algorithms.

In this work, a new quaternion-based method for color image watermarking is proposed. In this method, a novel set of quaternion radial substituted Chebyshev moments (QRSCMs) is presented for robust geometrically invariant image watermarking. An efficient computational method is proposed for highly accurate, fast, and numerically stable QRSCMs in polar coordinates. The proposed watermarking method consists of three stages. In the first stage, the Arnold transform is used to improve the security of the watermarking scheme by scrambling the binary watermark. In the second stage, the proposed accurate and stable QRSCMs of the host color image are computed. In the third stage, the encrypted binary watermark is embedded into the host image by employing the quantization technique on selected-magnitude QRSCMs where the watermarked color image is obtained by adding the original host color image to the compensation image. Then, the binary watermark can be extracted directly without using the original image from the magnitudes of QRSCMs. Numerical experiments are performed where the performance of proposed method is compared with the existing quaternion moment-based watermarking methods. The comparison clearly shows that the proposed method is very efficient in terms of the visual imperceptibility capability and the robustness under different attacks compared to the existing quaternion moment-based watermarking algorithms.

Securing medical images is a very essential process in medical image authentication. Medical image watermarking is a very popular tool to achieve this goal. In this paper, an extremely fast, highly accurate and robust algorithm is proposed for watermarking both gray-level and color medical images. In the proposed method, a scrambled binary watermark is embedded in the host medical image. Simplified exact kernels are used to compute the moments of the polar complex exponential transform (PCET) for the host gray-level images and the moments of the quaternion polar complex exponential transform (QPCET) for the host color images without approximation errors. The stability of the computed moments enables us to use higher order moments in a perfect reconstruction of the watermarked medical images. The accurate moment invariant to rotation, scaling, and translation ensures the robustness of the proposed watermarking algorithm against geometric attacks. Performed experiments clearly show very high visual imperceptibility and robustness to different levels of geometric distortions and common signal processing attacks. The implementation of parallel multi-core CPU and GPU results in a tremendous reduction of the overall watermarking times. For a color image of size 256×256, the watermarking time is accelerated by 20x and 11x using a GPU and a CPU with 16 cores, respectively.

Robust watermarking is a valuable methodology used in protecting the copyright and securing digital images. In this paper, new fractional-order multi-channel orthogonal exponent moments (MFrEMs) and their invariants to geometric transformations are derived for the first time. We utilized these highly accurate moments to construct a new robust watermarking algorithm for color images. This algorithm consists of three phases. First, the bits of the binary watermark scrambled by using a 1D Sine chaotic map. Second, the fractional-order MFrEMs are calculated from the host color image. Finally, a quantization process is performed, where the scrambled bits of the binary watermark embedded into the host color image. Various experiments were conducted to test the proposed watermarking algorithm and compare it with the existing robust watermarking algorithms for color images. The obtained results ensure the proposed robust watermarking algorithm’s superiority over existing algorithms regarding the visual imperceptibility and robustness against various attacks.