IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7336474.html
   My bibliography  Save this article

Disbursal of Text Steganography in the Space of Double-Secure Algorithm

Author

Listed:
  • Yahya Khan
  • Ali Algarni
  • Aisha Fayomi
  • Abdullah M. Almarashi

Abstract

Hackers reveal sensitive information from encrypted conversations as the globe has become one community. As a result, steganography and cryptography are used together to safeguard sensitive data more effectively than previous approaches and newly developed algorithms. A double-secure algorithm for text steganography (DSTS) is the safest approach compared to the paragraph hiding method (PHM) and capital alphabet shape encoding (CASE) method. In this context, the paragraph hiding method uses ASCII coding, which is not a standard method, and the CASE method has a security issue that if someone understands its applicability, it can be easily attacked. DSTS algorithm overcomes its limitations by using UTF-16 coding and enhances the security of CASE with a one-time pad (OTP). The one-time pad is a theoretically unbreakable cryptographic method. Still, it is not feasible for long messages, however, it is usable for short messages such as a password or intelligence agency’s more secure messages. DSTS degrades the average hiding capacity in a PHM from 2.06% to 1% due to UTF-16 coding. Using the UTF-8 method, the authors have improved MDSTS and the CMPHM by 6.49% and 7.76% hiding capacity, which outperforms in existing procedures; in the CMPHM, there is one reason for the improvement in hiding capacity is using the LZW compression method. CMHPM algorithm optimization standard deviation is less than that of the HPM, DSTS, and MDSTS, ultimately increasing speed.

Suggested Citation

  • Yahya Khan & Ali Algarni & Aisha Fayomi & Abdullah M. Almarashi, 2021. "Disbursal of Text Steganography in the Space of Double-Secure Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-9, December.
  • Handle: RePEc:hin:jnlmpe:7336474
    DOI: 10.1155/2021/7336474
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/7336474.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2021/7336474.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/7336474?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:7336474. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.