Abstract
In this research, we propose a new approach to increase the capacity and enhance the reliability of hiding voice data in Arabic text. Using Kashida to hide bits in Arabic text is one of the most promising approaches in steganography. Unfortunately, ignoring the original Kashida in the cover text may affect the results significantly and produce inaccurate results in the extraction process. In this study, we propose tremendous improvements to the Kashida method by considering original Kashida(-) in the cover text, error-detection using Cyclic Redundancy Check (CRC) and hiding bit using the La word. Moreover, hiding voice files within Arabic text is considered. The proposed approach is compared with the most related approaches in terms of capacity, security and reliability. Not only are the findings of the paper promising, they also overcome the limitations of other approaches.
Highlights
Steganography is the science of hiding information via embedding hidden content in a remarkable cover media
“Capacity refers to the amount of data bits that can be hidden in the cover medium
The time to extract the secret message is reduced dramatically, as compared with the related approaches in Arabic text steganography since the proposed approach depends on the size of the secret message and Cyclic Redundancy Check (CRC) rather than the size of cover text as in (Azawi and Fadhil, 2010; Gutub and Fattani, 2007)
Summary
Steganography is the science of hiding information via embedding hidden content in a remarkable cover media. The proposed architecture of hiding voice data in an Arabic text using kashida and “La” with loss-less compression and cyclic redundancy check system (HVDATKLCRCS) depends on two phases; embedding data phase and extracting original data phase. Throughout an extensive testing, we approach the 100% reliability, because of eliminating the original Kashida from being considered as part of the secret message in the extracting phase and deploying CRC to detect and correct errors. The time to extract the secret message is reduced dramatically, as compared with the related approaches in Arabic text steganography since the proposed approach depends on the size of the secret message and CRC rather than the size of cover text as in (Azawi and Fadhil, 2010; Gutub and Fattani, 2007). It is obvious that the size of the secret message in addition to the size of the CRC is still less than the size of the cover text and using key and key 2 to indicate the end of embedded bits reduces the time of the extraction process
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
