# A Dynamic Multi-Layer Steganography Approach Based on Arabic Letters' Diacritics and Image Layers
## 3 The Proposed Approach
### Experimental and Investigations on the Proposed Method Based on the Steganography Metrics
#### 4.3.3 Security and Imperceptibility Features
Thus, the imperceptibility criterion can be deemed moderately successful in this case, particularly with a short secret message length, as the text would not arouse suspicion, given the simplicity of the errors, which are often present in some Arabic texts. However, for longer secret messages and a higher number of diacritical errors, the Hamza scenario might be more effective than the diacritical scenario. In the present case, numerous diacritical errors are evident, which would be noticeable to an expert reader of the Arabic language. Consequently, when dealing with longer secret messages, we must either significantly increase the length of the cover text or rely on the embedding layer within the image for additional protection. In such cases, steganography analysis would be extremely challenging, since the detector would only have access to a small fraction of the message in both scenarios. Automated testing for all cases would be very expensive, particularly in the diacritical scenario, and the difficulty would only increase with the length of the text. Therefore, the proposed algorithm for texts could be deemed effective in such cases without the need for an image layer. The fourth text is comprehensively formed and surpasses its predecessors in length. Nonetheless, the outcomes it yields completely validate the results of the previous text, albeit with additional time and effort devoted (Figure 17a,b). The larger size of the text  
Figure 17: (Main, (**a**,**b**)): the average time in minutes of secret detection using phase 2.  
considerably elevates the level of security and intensifies the complexity of penetrating and cracking the encrypted message. Consequently, employing an image layer may be unnecessary in such scenarios. It is imperative to note that all previous experiments discussed the process of decrypting the encrypted secret message, not the underlying message. Therefore, the attacker must also decrypt the message, which substantiates the robustness of the proposed algorithm. Regarding the criterion of robustness, text-based algorithms typically exhibit higher efficiency and immunity than their image-based counterparts. This is because most image compression algorithms lose a portion of the data, necessitating the use of image-based steganography techniques based on the frequency domain, as opposed to those based on the spatial domain, such as the least significant bit (LSB) method. Input (cover + secret)  
Output (hidden secret)  
**Step1:** Determine the scenario of choice for hiding secret messages: Diacritics or Hamzas  
**Step2:** Calculate the Capacity to determine which scenario has the highest capacity. **Step3:** Apply Testing for Crypto Analysis and Imperceptibility Criterion to evaluate the effectiveness of the chosen scenario. 1. If the chosen scenario is inadequate in terms of imperceptibility:  
Then, employ the third and fourth layers of protection by encrypting and encapsulating the entire small text within an image. Conceal the secret message within the chosen scenario by modifying the necessary characters according to the predefined MAP. 2. If the secret message is longer  
Then, significantly increase the length of the cover text or rely on the embedding layer within the image for additional protection. 3. If necessary, employ an image layer for additional security in larger scenarios. 4. Use text-based algorithms for higher efficiency and immunity. If image-based algorithms are used, embedding techniques are based on the frequency domain. **Algorithm 3** for Steganography layers selection.