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

Authors: Yahya Khan; Ali Algarni; Aisha Fayomi; Abdullah M. Almarashi
Journal: Mathematical Problems in Engineering
 (2021)

---

## 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.


---

## Body

## 1. Introduction

The Internet has increased digital communication. Different types of people use the internet for various purposes; therefore, digital communication is not safe. According to [1], it is challenging to save yourself from online attackers. The latest forecast from Gartner Inc. says worldwide information security spending reached $93 billion in 2018 and an estimated $124 billion in 2019 [2]. Establishing reliable communication between two parties which share confidential data is difficult due to the probability of attacks and unplanned changes during an active transmission over an unsafe network. The attacker's critical success is to achieve confidential data from a system to understand; then, they have been modified or used for future attacks, as shown in Figure 1 [3].Figure 1
The hacking attack on confidential data.However, using either cryptography or steganography can secure our hidden information. A word's meaning is changed; the data are altered into cipher codes that a layperson cannot readout. Cryptography's downside is that it is directly applied to text, while steganography is applied via an innocent object called cover carrier (e.g., text, image, audio, or video). Steganography uses different media carriers such as image, video, audio, and text for concealing confidential data [4]. In digital communication, text steganography plays a vital role by hiding data in cover text in an innocent-looking way with less memory and high speed [5]. Most of the existing text-based literature pays attention to the achievement of high hidden capacity rather than high robustness and invisibility of the stego message. However, current techniques have a tradeoff between high embedding capacity and invisibility; if one method successfully achieves one trait, it lacks others, automatically [6]. Hybrid approaches of cryptography and steganography are more secure than single-text steganographic or cryptographic methods [7]. This method provides a two-layer protocol for hiding confidential information. The first layer did not allow modification in a cover object, while the second layer hid data in a multiple-cover object. Scholars have used various algorithms and methods in the literature to protect confidential data transmission, but information security is still a challenge. Agarwal [8] has proposed algorithms, missing letter puzzles, hiding data in the wordlist act on ASCII value instead of a binary value; therefore, their hiding capacity is maximum. A double-secure algorithm for text steganography (DSTS) [9] is the safest approach than the paragraph hiding method (PHM) and capital alphabet shape encoding (CASE) method.However, due to randomly generated cover text, these methods are exposed to structural attacks. The more secure algorithm is the paragraph hiding method [8], which uses a natural-looking cover text, i.e., it takes a cover text from any book or newspaper; but still, a more secure text steganographic method than the current approach is needed. Consequently, a double-secure algorithm for text steganography [9] is the safe method due to combining the best features of the paragraph hiding method with text steganography based on the feature coding method [10], even though it downgrades the current paragraph hiding approach's average hiding capacity from 2.06% to 1%. The enhancement in the capacity of the double-secure algorithm for text steganography has improved the average hiding capacity with MDSTS from 1% to 3.98% with UTF-16 and 6.49% with UTF-8. Similarly, the CMPHM improved 4.63% with UTF-16 and 7.76% with UTF-8 due to the removal of redundancy in the paragraph approach's secret messages using the LZW method. The CMPHM has more capacity for private messages with three security layers than the hybrid PHM.


### 1.1. Existing Methods

Cryptography is altering data or messages into codes to make it difficult for the layperson to understand. However, in steganography, confidential data are hidden except for the sender and receiver. The word steganography originates from “steganographia,” which infers “confidential” or “secret writing.”. Therefore, steganography is the skill and discipline of writing secret messages so that no one suspects the data’s existence apart from the sender and receiver [11]. Different steganography types hide confidential data in audio, video, image, and text covers. Text steganography is more challenging due to redundancy but uses less memory and higher speed than other steganographic methods. For text hiding methods, three main issues are to be considered: capacity, security, and robustness. The capacity refers to a carrier media's capability to confidentially stock data; the capacity ratio can be calculated as the number of secret data bytes divided by the number of cover text bytes. Security is the hackers’ skill to figure out or suspect hidden data with no trouble. The robustness mentions protecting the unseen data from exploitation, mainly transmitted through the network [12]. Different information security experts presented some popular text steganography approaches to incorporate capacity, security, and robustness. Text steganography is classified into structural or format-based techniques, linguistic techniques, and random and statistical production, as shown in Figure 2 [13].Figure 2
Different types of text hiding techniques.


#### 1.1.1. Structural Technique

Linguistic methods can change the syntax and semantics features of the text. Words, sentences, verbs, nouns, adverbs, and adjectives formulate a text. Linguistic techniques have two types, syntactic and semantic. Synonyms, abbreviations, and similarities of words have been used by the semantic method, and secret bits are hidden in the cover message [14]. Optical character recognition software or retyping attacks cannot hide hidden messages using semantic methods [15]. These techniques change cover letters, which create a suspect in the reader's mind. Semantic methods counter structural attacks with high invisibility, low hiding capacity, and increased robustness, while syntactic forms alter cover messages without changing the text content's meaning [16]. The syntactical-based algorithms have low hiding capacity, high invisibility, and increased robustness against structural attacks but are exposed to visual attacks.


#### 1.1.2. Random and Statistical Production

This method can be classified into compression and random cover methods. The compression method is a subtype of the random and statistical method [17]. The compression-based methods use an algorithm such as Huffman coding, and the Lempel–Ziv–Welch (LZW) compression method uses lossless compression techniques to conceal confidential data in cover messages of text steganography. Compression methods with high invisibility, maximum hiding capacity, and low robustness counter structural attacks.The random cover method is a subtype of the random and statistical method. The random cover uses secret message statistical structures to generate the cover message [18]. These methods perform with high robustness against visual attacks, but the problem of random cover-based techniques is low invisibility and low capacity [8,19]. Furthermore, they have great computational difficulty in producing the cover message during the embedding/extraction process.The interword spacing and interparagraph spacing combined method is a new method for text steganography, and the secret message's length is dynamically generated [20]. But, any word processor can detect and delete the spaces. The newly proposed combined algorithms of one-time cryptography and text steganography missing letter puzzles and hiding data in the word list use ASCII value, and the randomly generated cover text is exposed to structural attacks. By contrast, the paragraph hiding method in [8] is more secure due to using a natural-looking cover text compared to the randomly generated cover text but needs additional security in text stenography such as text steganography based on the feature coding method [10] that secure hiding data from visual attacks and structural attack. Therefore, the DSTS [9] algorithm has included CASE as a third security layer. Still, on the other side, it has a low average hiding capacity of 1% compared to the paragraph method with 2.06%. Hence, the DSTS method needs further investigation for average hiding capacity, improvement, and removal of redundancy. The algorithm for text steganography addresses this problem in two parts; one is MDSTS, and the other is the CMPHM.


## 1.1. Existing Methods

Cryptography is altering data or messages into codes to make it difficult for the layperson to understand. However, in steganography, confidential data are hidden except for the sender and receiver. The word steganography originates from “steganographia,” which infers “confidential” or “secret writing.”. Therefore, steganography is the skill and discipline of writing secret messages so that no one suspects the data’s existence apart from the sender and receiver [11]. Different steganography types hide confidential data in audio, video, image, and text covers. Text steganography is more challenging due to redundancy but uses less memory and higher speed than other steganographic methods. For text hiding methods, three main issues are to be considered: capacity, security, and robustness. The capacity refers to a carrier media's capability to confidentially stock data; the capacity ratio can be calculated as the number of secret data bytes divided by the number of cover text bytes. Security is the hackers’ skill to figure out or suspect hidden data with no trouble. The robustness mentions protecting the unseen data from exploitation, mainly transmitted through the network [12]. Different information security experts presented some popular text steganography approaches to incorporate capacity, security, and robustness. Text steganography is classified into structural or format-based techniques, linguistic techniques, and random and statistical production, as shown in Figure 2 [13].Figure 2
Different types of text hiding techniques.


### 1.1.1. Structural Technique

Linguistic methods can change the syntax and semantics features of the text. Words, sentences, verbs, nouns, adverbs, and adjectives formulate a text. Linguistic techniques have two types, syntactic and semantic. Synonyms, abbreviations, and similarities of words have been used by the semantic method, and secret bits are hidden in the cover message [14]. Optical character recognition software or retyping attacks cannot hide hidden messages using semantic methods [15]. These techniques change cover letters, which create a suspect in the reader's mind. Semantic methods counter structural attacks with high invisibility, low hiding capacity, and increased robustness, while syntactic forms alter cover messages without changing the text content's meaning [16]. The syntactical-based algorithms have low hiding capacity, high invisibility, and increased robustness against structural attacks but are exposed to visual attacks.


### 1.1.2. Random and Statistical Production

This method can be classified into compression and random cover methods. The compression method is a subtype of the random and statistical method [17]. The compression-based methods use an algorithm such as Huffman coding, and the Lempel–Ziv–Welch (LZW) compression method uses lossless compression techniques to conceal confidential data in cover messages of text steganography. Compression methods with high invisibility, maximum hiding capacity, and low robustness counter structural attacks.The random cover method is a subtype of the random and statistical method. The random cover uses secret message statistical structures to generate the cover message [18]. These methods perform with high robustness against visual attacks, but the problem of random cover-based techniques is low invisibility and low capacity [8,19]. Furthermore, they have great computational difficulty in producing the cover message during the embedding/extraction process.The interword spacing and interparagraph spacing combined method is a new method for text steganography, and the secret message's length is dynamically generated [20]. But, any word processor can detect and delete the spaces. The newly proposed combined algorithms of one-time cryptography and text steganography missing letter puzzles and hiding data in the word list use ASCII value, and the randomly generated cover text is exposed to structural attacks. By contrast, the paragraph hiding method in [8] is more secure due to using a natural-looking cover text compared to the randomly generated cover text but needs additional security in text stenography such as text steganography based on the feature coding method [10] that secure hiding data from visual attacks and structural attack. Therefore, the DSTS [9] algorithm has included CASE as a third security layer. Still, on the other side, it has a low average hiding capacity of 1% compared to the paragraph method with 2.06%. Hence, the DSTS method needs further investigation for average hiding capacity, improvement, and removal of redundancy. The algorithm for text steganography addresses this problem in two parts; one is MDSTS, and the other is the CMPHM.


## 1.1.1. Structural Technique

Linguistic methods can change the syntax and semantics features of the text. Words, sentences, verbs, nouns, adverbs, and adjectives formulate a text. Linguistic techniques have two types, syntactic and semantic. Synonyms, abbreviations, and similarities of words have been used by the semantic method, and secret bits are hidden in the cover message [14]. Optical character recognition software or retyping attacks cannot hide hidden messages using semantic methods [15]. These techniques change cover letters, which create a suspect in the reader's mind. Semantic methods counter structural attacks with high invisibility, low hiding capacity, and increased robustness, while syntactic forms alter cover messages without changing the text content's meaning [16]. The syntactical-based algorithms have low hiding capacity, high invisibility, and increased robustness against structural attacks but are exposed to visual attacks.


## 1.1.2. Random and Statistical Production

This method can be classified into compression and random cover methods. The compression method is a subtype of the random and statistical method [17]. The compression-based methods use an algorithm such as Huffman coding, and the Lempel–Ziv–Welch (LZW) compression method uses lossless compression techniques to conceal confidential data in cover messages of text steganography. Compression methods with high invisibility, maximum hiding capacity, and low robustness counter structural attacks.The random cover method is a subtype of the random and statistical method. The random cover uses secret message statistical structures to generate the cover message [18]. These methods perform with high robustness against visual attacks, but the problem of random cover-based techniques is low invisibility and low capacity [8,19]. Furthermore, they have great computational difficulty in producing the cover message during the embedding/extraction process.The interword spacing and interparagraph spacing combined method is a new method for text steganography, and the secret message's length is dynamically generated [20]. But, any word processor can detect and delete the spaces. The newly proposed combined algorithms of one-time cryptography and text steganography missing letter puzzles and hiding data in the word list use ASCII value, and the randomly generated cover text is exposed to structural attacks. By contrast, the paragraph hiding method in [8] is more secure due to using a natural-looking cover text compared to the randomly generated cover text but needs additional security in text stenography such as text steganography based on the feature coding method [10] that secure hiding data from visual attacks and structural attack. Therefore, the DSTS [9] algorithm has included CASE as a third security layer. Still, on the other side, it has a low average hiding capacity of 1% compared to the paragraph method with 2.06%. Hence, the DSTS method needs further investigation for average hiding capacity, improvement, and removal of redundancy. The algorithm for text steganography addresses this problem in two parts; one is MDSTS, and the other is the CMPHM.


## 2. Methodology

Our methodology has twoparts to improve the average hiding capacity of the current method.(1)
Modified double-secure algorithm for text steganography (MDSTS)(2)
Compression modified paragraph hiding method (CMPHM)


### 2.1. MDSTS

As we know that the DSTS algorithm has a low average hiding capacity and MDSTS improves DSTS capacity from 1 bit per word to 4 bits for a word in the cover text, that modification is called modified DSTS. So, the hiding capacity of MDSTS increases four times that of the DSTS algorithm. MDSTS also enjoys three security layers (modified CASE layer, one-time pad cryptography, and modified paragraph hiding method).


### 2.2. New Algorithm of the Modified Paragraph Hiding method (MPHM)

The modified paragraph hiding method (MPHM) modifies the existing paragraph hiding method [8]. The paragraph approach hides 4 bits per word in the cover text, and the existing method can hide only one bit per word in the text carrier. So, MPHM increases the hiding capacity of the existing process. The algorithm of the MPHM is mentioned in the following (Algorithms 1 and 2).Algorithm 1: Hide algorithm 1.
(1)
Get a cover file(2)
Convert the confidential message to its binary equivalent (bin)(3)
Read a word from the cover file and write it in a stego file.(4)
Skip that word that has the same start and end letters, and then, read the next word from the cover text(5)
Repeat 4 times(a)
Read a bit (x) from the bin b.(b)
S = start letter of the word, and E = end letter of the word(c)
Ifx = 0, write S in the stego key(d)
Else ifx = 1, write E in the stego key(6)
End repeat(7)
Repeat 3 to 6 times until the end of the bin file(8)
Send the stego key and stego text to the receiverAlgorithm 2: Seek algorithm 1.
(1)
Read the word from the stego file(2)
If the start and end letter of the word are the same, then skip it and read the next word from the stego file(3)
Select the beginning and end character of the word(a)
Read the letter from the stego key(b)
Ifc = s, then b = 0(c)
Else ifc = e, then b = 1(4)
Repeat four times(5)
End repeat(6)
Writeb to file(7)
Execute the abovementioned file till the end of the key(8)
Convert the binary file to the character file


### 2.3. Block Diagram of Modified DSTS

Figure3 shows a block diagram of modified DSTS. The first block is an encoding function that encodes the confidential data; the 2nd block is an encrypted function, which encrypts the encoded data and generates a one-time pad key; the 3rd block is a hiding function that hides the enciphered data and generates a stego key; then, the stego text is sent to the network; the 4th block is a seeking procedure which unhides the stego text with the stego key; the 5th block is a deciphering function which deciphers data with the key; and the 6th block is a decoding process which gives the original data.Figure 3
Modified DSTS.


### 2.4. Compression Modified Paragraph Hiding method(CMPHM)

The 2nd part of this research uses the LZW compression method with a modified paragraph approach to further improve its hiding capacity. The compression method removes redundancy in the messages of a modified paragraph approach. The compression module is a subtype of text steganography and acts as a third security layer described in [21]. The proposed method's framework is shown in the following. Figure 4 shows the compression module using the modified paragraph approach.Figure 4
Compression module using the modified paragraph approach.The first block is the compressing function, which compresses the confidential data. The 2nd block is the encrypted function, which enciphers the compressed data with a one-time pad key. The 3rd block is a hiding function which hides the enciphered data and generates a stego key; then, the stego text and keys are sent to the network. The 4th block is a seeking procedure which unhides the stego text with the stego key. The 5th block is a deciphering function which deciphers data with the encipher key. The 6th block is a decompressing function which gives the original data.


## 2.1. MDSTS

As we know that the DSTS algorithm has a low average hiding capacity and MDSTS improves DSTS capacity from 1 bit per word to 4 bits for a word in the cover text, that modification is called modified DSTS. So, the hiding capacity of MDSTS increases four times that of the DSTS algorithm. MDSTS also enjoys three security layers (modified CASE layer, one-time pad cryptography, and modified paragraph hiding method).


## 2.2. New Algorithm of the Modified Paragraph Hiding method (MPHM)

The modified paragraph hiding method (MPHM) modifies the existing paragraph hiding method [8]. The paragraph approach hides 4 bits per word in the cover text, and the existing method can hide only one bit per word in the text carrier. So, MPHM increases the hiding capacity of the existing process. The algorithm of the MPHM is mentioned in the following (Algorithms 1 and 2).Algorithm 1: Hide algorithm 1.
(1)
Get a cover file(2)
Convert the confidential message to its binary equivalent (bin)(3)
Read a word from the cover file and write it in a stego file.(4)
Skip that word that has the same start and end letters, and then, read the next word from the cover text(5)
Repeat 4 times(a)
Read a bit (x) from the bin b.(b)
S = start letter of the word, and E = end letter of the word(c)
Ifx = 0, write S in the stego key(d)
Else ifx = 1, write E in the stego key(6)
End repeat(7)
Repeat 3 to 6 times until the end of the bin file(8)
Send the stego key and stego text to the receiverAlgorithm 2: Seek algorithm 1.
(1)
Read the word from the stego file(2)
If the start and end letter of the word are the same, then skip it and read the next word from the stego file(3)
Select the beginning and end character of the word(a)
Read the letter from the stego key(b)
Ifc = s, then b = 0(c)
Else ifc = e, then b = 1(4)
Repeat four times(5)
End repeat(6)
Writeb to file(7)
Execute the abovementioned file till the end of the key(8)
Convert the binary file to the character file


## 2.3. Block Diagram of Modified DSTS

Figure3 shows a block diagram of modified DSTS. The first block is an encoding function that encodes the confidential data; the 2nd block is an encrypted function, which encrypts the encoded data and generates a one-time pad key; the 3rd block is a hiding function that hides the enciphered data and generates a stego key; then, the stego text is sent to the network; the 4th block is a seeking procedure which unhides the stego text with the stego key; the 5th block is a deciphering function which deciphers data with the key; and the 6th block is a decoding process which gives the original data.Figure 3
Modified DSTS.


## 2.4. Compression Modified Paragraph Hiding method(CMPHM)

The 2nd part of this research uses the LZW compression method with a modified paragraph approach to further improve its hiding capacity. The compression method removes redundancy in the messages of a modified paragraph approach. The compression module is a subtype of text steganography and acts as a third security layer described in [21]. The proposed method's framework is shown in the following. Figure 4 shows the compression module using the modified paragraph approach.Figure 4
Compression module using the modified paragraph approach.The first block is the compressing function, which compresses the confidential data. The 2nd block is the encrypted function, which enciphers the compressed data with a one-time pad key. The 3rd block is a hiding function which hides the enciphered data and generates a stego key; then, the stego text and keys are sent to the network. The 4th block is a seeking procedure which unhides the stego text with the stego key. The 5th block is a deciphering function which deciphers data with the encipher key. The 6th block is a decompressing function which gives the original data.


## 3. Test Run

We have confidential data, “eye,” to be hidden in a cover text. After encoding, the confidential data change into an encoding format “00″ and then into the enciphered format “ čÈM.” Figure5 demonstrates the cover text, and Figure 6 illustrates the stego text file. It can realize that the two documents are identical.Figure 5
The cover text.Figure 6
The stego text file.


## 4. Experimental Result

We implemented the algorithms in C# language using BenchmarkDotNet=v0.12.1, OS = Windows 10 Intel Core i5-6300U CPU 2.40 GHz (Skylake), 1 CPU, and 4 logical and 2 physical cores. NET Core SDK = 5.0.101. This section analyses the experimental results and benchmarks the proposed approaches' performance with other text steganographic methods.The mean and standard deviation in Table1 show that the compression module using the modified paragraph approach standard deviation is less than a paragraph algorithm and modified DSTS, demonstrating its higher optimization and speed.Table 1
Comparing the mean and standard deviation of different approaches.
TypesMean (μs)Standard deviation (μs)Missing letter puzzle589.918.67Hiding data in the wordlist262.724.89Paragraph hiding approach650.641.01A novel approach249.717.02MDSTS656.948.72CMPHM698.337.25


### 4.1. Capacity

Steganographic performance is the calculation in terms of capacity, security, and robustness. Capacity shows how much secret information the algorithm can send. Security is an essential factor that shows how much confidential data is hidden from the attackers. Robustness measures the ability to protect personal data from modification. Capacity is the amount of confidential data in a carrier text. The capacity relationship is the division of the quantity of concealed bytes over the cover text size in bytes [12].(1)Capacity ratio=amount of hidden bytessize of the cover text in bytes.Supposing one character resides one byte in memory, the capacity ratio multiplied by 100 is called the percentage capacity. Different messages are given below.(1)
Eye (3 bytes).(2)
Blue eyes (10 bytes).(3)
Blue eyes and black eyes (25 bytes).(4)
Searching eye drops for eye problems in the home (50 bytes).(5)
Some eye specialists suggest using eye drops for eye problems (63 bytes).(6)
Some eye specialists suggest using eye drops for eye problems in bad weather and advise washing eyes (100).(7)
Some eye specialists suggest using eye drops for eye problems in bad weather and advise washing eyes with cold water in summer. Some medical doctors recommend using sunglasses on sunny days in the summer season (204).Table2 shows the hiding capacity of 7 different messages in the cover text for the first, second, and third methods [8], DSTS, modified DSTS, and compression module using the modified paragraph approach.Table 2
Percentage capacity of the proposed approaches over the seven experimental samples.
ApproachesIIIIIIIVVVIVIIMissing letter app2.885.409.098.798.608.718.83Wordlist approach2.945.558.338.798.848.958.93Paragraph hiding method1.961.922.062.002.082.122.13DSTS approach1.00.9431.02.9961.0081.0031.005MDSTS43.774.083.984.0324.0124.020CMPHM43.774.844.554.684.965.64Table3 shows the average percentage hiding capacity of different text steganography approaches and proposed methods. The proposed method’s average hiding capacity is higher using the UTF-16 method, except for missing letter puzzle and wordlist, and it works on the ASCII method, and the randomly generated cover text is exposed to structural attack in the paragraph approach using the UTF-8 method.Table 3
Average percentage capacity of the techniques (having av. % capacity = 1).
Missing letter approachWordlist approachCMHMMDSTSHPMWhite steg7.67.674.63 (UTF-16), 7.76 (UTF-8)3.98 (UTF-16), 6.49 (UTF-8)2.06 (ASCII), 1.95 (UTF-8)1.87SMS textingFeature codingWord mapSpam textingWord shiftDSTS1.711.471.461.161.031 (UTF-16), 1.66 (UTF-8)Table4 presents the seven embedded messages. The experimental result demonstrates that the cover text for the text steganography method increases with the length of secret messages. In contrast, the compression module using the modified paragraph approach cover text increases less due to redundancy in secret messages. So, the compression module using the modified paragraph approach saves embedding space.Table 4
Comparing the cover text size of the proposed approaches for secret messages.
Message length in bytesMDSTS (cover text length)Compressed message length in bytesCMPHM (cover text length)13296329621010611010613252437212065450503044439856362515453776100997381807272022011814314248


## 4.1. Capacity

Steganographic performance is the calculation in terms of capacity, security, and robustness. Capacity shows how much secret information the algorithm can send. Security is an essential factor that shows how much confidential data is hidden from the attackers. Robustness measures the ability to protect personal data from modification. Capacity is the amount of confidential data in a carrier text. The capacity relationship is the division of the quantity of concealed bytes over the cover text size in bytes [12].(1)Capacity ratio=amount of hidden bytessize of the cover text in bytes.Supposing one character resides one byte in memory, the capacity ratio multiplied by 100 is called the percentage capacity. Different messages are given below.(1)
Eye (3 bytes).(2)
Blue eyes (10 bytes).(3)
Blue eyes and black eyes (25 bytes).(4)
Searching eye drops for eye problems in the home (50 bytes).(5)
Some eye specialists suggest using eye drops for eye problems (63 bytes).(6)
Some eye specialists suggest using eye drops for eye problems in bad weather and advise washing eyes (100).(7)
Some eye specialists suggest using eye drops for eye problems in bad weather and advise washing eyes with cold water in summer. Some medical doctors recommend using sunglasses on sunny days in the summer season (204).Table2 shows the hiding capacity of 7 different messages in the cover text for the first, second, and third methods [8], DSTS, modified DSTS, and compression module using the modified paragraph approach.Table 2
Percentage capacity of the proposed approaches over the seven experimental samples.
ApproachesIIIIIIIVVVIVIIMissing letter app2.885.409.098.798.608.718.83Wordlist approach2.945.558.338.798.848.958.93Paragraph hiding method1.961.922.062.002.082.122.13DSTS approach1.00.9431.02.9961.0081.0031.005MDSTS43.774.083.984.0324.0124.020CMPHM43.774.844.554.684.965.64Table3 shows the average percentage hiding capacity of different text steganography approaches and proposed methods. The proposed method’s average hiding capacity is higher using the UTF-16 method, except for missing letter puzzle and wordlist, and it works on the ASCII method, and the randomly generated cover text is exposed to structural attack in the paragraph approach using the UTF-8 method.Table 3
Average percentage capacity of the techniques (having av. % capacity = 1).
Missing letter approachWordlist approachCMHMMDSTSHPMWhite steg7.67.674.63 (UTF-16), 7.76 (UTF-8)3.98 (UTF-16), 6.49 (UTF-8)2.06 (ASCII), 1.95 (UTF-8)1.87SMS textingFeature codingWord mapSpam textingWord shiftDSTS1.711.471.461.161.031 (UTF-16), 1.66 (UTF-8)Table4 presents the seven embedded messages. The experimental result demonstrates that the cover text for the text steganography method increases with the length of secret messages. In contrast, the compression module using the modified paragraph approach cover text increases less due to redundancy in secret messages. So, the compression module using the modified paragraph approach saves embedding space.Table 4
Comparing the cover text size of the proposed approaches for secret messages.
Message length in bytesMDSTS (cover text length)Compressed message length in bytesCMPHM (cover text length)13296329621010611010613252437212065450503044439856362515453776100997381807272022011814314248


## 5. Equation of Similarity

(2)Jaro–Winlers1,s2=Jaros1,s2+L×p1−Jaros1,s2,Jaros1,s2=13×ms1+ms2+m−tm.The algorithm's similarity was tested using Jaro–Winkler, which examines how the cover text and the secret text are very similar to each other. The Jaro scoreis a similarity distance.s1 and s2 are the cover file and the stego file (two strings) whose similarity is to be calculated.L is the length of a common prefix (maximum 4 characters), p is the scaling factor whose standard value is 0.1, m represents the number of matching characters of strings, and t is the number of transpositions. Two characters are similar if their distance is not more than _max (|s1|, |s2|)/2. −1. String 1's every character is matched with every character of string 2. Jaro score 0 means that the strings are not similar, and 1 means they are the same. Table 5 shows that the missing letter puzzle has 0.97 similarities. Table 6 compars the average hiding capacity methods using the UTF-8 method.Table 5
Jaro score of 7 samples of embedded data.
7 MessagesCS1CS2CS3CS4CS5CS6CS7Jaro score0.980.980.970.970.970.980.97Table 6
Comparing the average hiding capacity methods using the UTF-8 method.
Message lengthCover text length (bytes)Capacity (%)DSTSGomal University (18 bytes)12911.4Agriculture University Dera Ismail Khan (40 bytes)23081.7Peshawar University, Peshawar, k. P. k, Pakistan (43 bytes)24401.76University of Science and Technology, China, Hefei (49 bytes)27491.78Average hiding capacity of DSTS using UTF-81.66Gomal University (18 bytes)3195.6MDSTSAgriculture University Dera Ismail Khan (40 bytes)5776.93Peshawar University, Peshawar, k.P.k, Pakistan (43 bytes)6186.80University of Science and Technology, China, Hefei (49 bytes)7416.61Average hiding capacity of MDSTS using UTF-86.49Gomal University (18 bytes)9591.9PHMAgriculture University Dera Ismail Khan (40 bytes)20342.0Peshawar University, Peshawar, k.P.k, Pakistan (43 bytes)21482.0University of Science and Technology, China, Hefei (49 bytes)25441.9Average hiding capacity of the PHM using UTF-81.95Gomal University (18 bytes)2208.18CMPHMAgriculture University Dera Ismail Khan (40 bytes)5267.60Peshawar University Peshawar, k.P.k, Pakistan (43 bytes)5777.4University of Science and Technology, China, Hefei (49 bytes)6237.86Average hiding capacity of the CMPHM using UTF-87.76Table7 shows the paragraph hiding method, DSTS, modified DSTS, and compression module using the modified paragraph method (CMPHM). The approach has an average Jaro score of 1, which shows these methods can send data without suspicion due to the natural-looking cover text.Table 7
Comparison of existing processes with the proposed methods.
ApproachesCoverWorks onA. V. capacity (%)SecurityAv. JaroMissing letter puzzleLetter puzzleASCII number7.62Secure0.97Wordlist approachList of wordsASCII number7.67More secure1CMPHMNatural-looking cover textBinary number UTF-164.631MDSTSNatural-looking cover textBinary number UTF-163.981PHMNatural-looking cover textBinary number2.0571DSTS approachNatural-looking cover textBinary number UTF-1611DSTS approachNatural-looking cover textBinary number UTF-81.661PHMNatural-looking cover textBinary number UTF-81.951MDSTSNatural-looking cover textBinary number UTF-86.491CMPHMNatural-looking cover textBinary number UTF-87.761


## 6. Discussion

The comparative study shows that missing letter puzzles and wordlist approaches work on the ASCII value of the embedded character, rather than its binary equivalent. It uses a randomly generated cover text exposed to structural attack. Consequently, the average paragraph hiding method’s capacity is lower than that of the missing letter puzzle and wordlist approaches. DSTS is the most secure algorithm compared to the paragraph hiding method, but with the most inadequate average hiding capacity of 1% than 2.06% of the paragraph hiding approach; therefore, it needs to enhance the hiding capacity of the DSTS algorithm. The experimental result of MDSTS is 3.98%, with 1.92% higher than the average hiding capacity of the paragraph hiding method and 2.98% higher than that of the DSTS. The CMPHM has an experimental result of 4.63%, which is 0.65% higher than that of the MDSTS, 2.57% higher than that of the paragraph hiding method, and 3.63% higher than that of the DSTS method. Using the UTF-8 method, the authors have further improved DSTS hiding capacity to 1.66%, PHM hiding capacity to 1.95%, MDSTS to 6.49%, and CMPHM to 7.76%. The experimental result of Table4 demonstrates that the cover text of many techniques increases with secret message’s size. Using the CMPHM removes redundancy in secret messages, so hiding capacity increases, and with lower cover text decreases the stego text which is the best method for a slow network.The proposed MDSTS is far better than the existing methods as it does not use extra white spaces or misspelled words to conceal the message. It uses CASE encoding, which is better than feature coding, provides security against visual attacks, and uses a natural-looking cover text to protect against structural attacks. The CMPHM also uses two steganographic text methods, one compression method, and the other MPHM. Therefore, stego files with both proposed ways will not create any doubt about the existence of a secret message if opened with a word processor, and the OCR technique cannot destroy confidential information. The MDSTS and CMPHM also use a one-time pad encipher key that any brute force attack cannot break, so it is the most secure algorithm. Therefore, it is safe to send a password and pin code on internet using the proposed methods. The CMPHM is faster when the secret message size increases, which is proved by algorithm optimization. So, the MDSTS and CMPHM satisfy the steganographics capacity and imperceptibility. Thus, these methods recognize and develop these two significant parts of the steganographic scheme.


## 7. Conclusions

We have investigated different methods using UTF-16 and UTF-8. Still, the problem with UTF-16 is that the hiding capacity of text steganography decreases by 50% with this method, which is evident from our experimental results. Nowadays, modern encoding and decoding methods use UTF-8. All cryptographic techniques use it as a standard method; our experimental results show that the CMPHM uses the UTF-8 method, and the hiding capacity improves 3.13% greater than with the UTF-16 method, 4.63%. Hence, the CMPHM on one side is a more secure method enjoying three-layer security and another side with higher space than the predecessor methods. The OCR technique cannot destroy confidential information in the proposed techniques. These methods use a natural-looking cover text, so the structural attack cannot disclose data. This method can be used for pin passwords and is most specific for intelligence agencies using the secure network for key distribution. Still, for future direction, we need to improve its cap further with more practical ways of cryptography than the one-time pad, which is impractical for large messages and has the burden of the key distribution [22–26].



---

*Source: 7336474-2021-12-29.xml*