**2. Deoxyribonucleic acid (DNA)**

The most important molecular structure in biology is deoxyribonucleic acid (DNA), which encodes the information required to generate and direct all chemical elements in the human body. As a result, DNA has been suggested as a possible candidate for computational purposes [18].

#### **2.1 DNA structure**

undetectable both visually and statistically. A fully reliable system with comparable carrier and stego file statistics should be considered during the message embedding process [5, 6]. The carrier's power, known as the amount of data concealed within it, is the second common prerequisite. The development of a steganography technique could allow more sensitive data to be hidden within the carrier while maintaining the properties of the stego file [1, 5]. A successful steganography strategy should keep enough information in its embedding capability [6].

Imperceptibility is the third common prerequisite, which is characterized as having a high embedding potential and the ability to resist intruders. The stego carrier should ideally be devoid of visual artifacts and the greater the stego carrier's fidelity

The masking theory is typically modeled by a pair of algorithms: embedding and

Several applications represent a container for confidential data. In steganography schemes, these programs are used as cover objects or carriers. Per carrier has its own set of characteristics that aid in the data concealment process. The carrier's field availability determines the amount of confidential information needed to hide

extraction, as seen in **Figure 1**. The embedding algorithm produces a stego file containing the private data by merging two folders, secret and vector data, with an optional key. On the other hand, the extraction algorithm is used to recover the secret data from the stego file [7]. Steganography is a method of concealing data that does not require the use of a key. Its protection depends on the privacy of the algorithm. As a result, it is known as a less reliable approach [8, 9]. Another way to hide information is to hide confidential data, which uses one key for all operations (embedding and extraction). One of the most important benefits of this type is its rapid stage in all procedures [10, 11]. Unlike previous patterns, public steganography uses two keys for embedding and extraction: embedding and the other for extracting. The biggest value of this type is the durability of the system. The identification of the other key could be a concern if one of the keys is identified by a third party [10, 12]. On the other hand, this model is 100–1000 times slower than

should be better [2].

*Data Integrity and Quality*

private steganography [13].

**Figure 1.**

**96**

*Block diagram of steganography system.*

DNA is described as a living creature's genetic blueprint. Each body cell has its DNA collection and a polymer made up of monomers called deoxyribose nucleotides, consisting of three components, as seen in **Figure 2** [19].

The human body is made up of trillions of cells, each with its purpose. As seen in **Figure 3**, each cell has a nucleus that comprises several chromosomes. The majority of DNA is present in a nucleus, which is known as nucleus DNA, and the remainder is found in mitochondria, which is known as mitochondria DNA (mtDNA). Each cell's activity is regulated by DNA. DNA chromosome is made up of a DNA molecule of genes. A gene is the entire genetic makeup of an organism, containing information from all chromosomes [20].

**Figure 2.** *Structure of deoxyribonucleic acid.*

In 1953, Watson and Crick discovered DNA structure, a form of genetic material. DNA is a long molecule present in all living things' body cells. DNA is a kind of bacterial plasma that contains all lifestyles. It is made up of two simple bands that are twisted around each other in a double helix (see **Figure 4**). Each DNA chain is made up of nucleotides, which are small subunits. The four chemical bases in the chain DNA are Adenine (A), Thymine (T), Guanine (G) and Cytosine (C), which bind to sugar and phosphates in the backbone to complete the nucleotide. Purines (A and G) and Pyrimidine (T and C) are the two DNA bases in biology. Continuously (A) is bound to (T) by two hydrogen bonds, and (C) is bound to (G) by three hydrogen bonds [19, 21]. Transcription is the method for producing RNA, which is an intermediate copy of DNA instructions. Adenine (A), Cytosine (C), Uracil (U), and Guanine (G) are the four bases that makeup RNA. All 64 codons are represented in **Figure 5**. The STOP codons do not necessarily symbolize any amino acids but rather indicate the protein chain's end. The twenty amino acids are determined by the remaining 61 codons. Some amino acids are coded by several codons [11]. As a result of this codon duplication, it is possible to change the genetic sequence while keeping it functional [11, 23, 24].

#### **2.2 DNA computing**

Currently, biology methods are used in a variety of fields. DNA is a relatively new biological technology that is used in a variety of applications [25]. This is because DNA computing can solve a variety of NP-complete problems, in which the computation time increases dramatically.

There has been a considerable amount of research in this field, with significant progress made on DNA and the immune system [19]. Leonard Adelman conducted the first experiment in DNA computing (bio-molecular computing) in 1994, in which molecular biology instruments were used to solve a portion of the standard path of the Hamiltonian puzzle. Computing with molecules directly was discovered at the time, and it was regarded as a new discipline in terms of science defense [26]. The satisfaction problem (SAT), an NP-complete problem, was solved using DNA

**Figure 5.**

**99**

**Figure 4.**

*Helical structure of DNA [20].*

*DNA Computing Using Cryptographic and Steganographic Strategies*

*DOI: http://dx.doi.org/10.5772/intechopen.97620*

*Codon and amino acid table [22].*

*DNA Computing Using Cryptographic and Steganographic Strategies DOI: http://dx.doi.org/10.5772/intechopen.97620*

**Figure 4.** *Helical structure of DNA [20].*

In 1953, Watson and Crick discovered DNA structure, a form of genetic material. DNA is a long molecule present in all living things' body cells. DNA is a kind of bacterial plasma that contains all lifestyles. It is made up of two simple bands that are twisted around each other in a double helix (see **Figure 4**). Each DNA chain is made up of nucleotides, which are small subunits. The four chemical bases in the chain DNA are Adenine (A), Thymine (T), Guanine (G) and Cytosine (C), which bind to sugar and phosphates in the backbone to complete the nucleotide. Purines (A and G) and Pyrimidine (T and C) are the two DNA bases in biology. Continuously (A) is bound to (T) by two hydrogen bonds, and (C) is bound to (G) by three hydrogen bonds [19, 21]. Transcription is the method for producing RNA, which is an intermediate copy of DNA instructions. Adenine (A), Cytosine (C), Uracil (U),

and Guanine (G) are the four bases that makeup RNA. All 64 codons are

sequence while keeping it functional [11, 23, 24].

computation time increases dramatically.

**2.2 DNA computing**

**98**

**Figure 3.**

*Gene development cycle.*

*Data Integrity and Quality*

represented in **Figure 5**. The STOP codons do not necessarily symbolize any amino acids but rather indicate the protein chain's end. The twenty amino acids are determined by the remaining 61 codons. Some amino acids are coded by several codons [11]. As a result of this codon duplication, it is possible to change the genetic

Currently, biology methods are used in a variety of fields. DNA is a relatively new biological technology that is used in a variety of applications [25]. This is because DNA computing can solve a variety of NP-complete problems, in which the

There has been a considerable amount of research in this field, with significant progress made on DNA and the immune system [19]. Leonard Adelman conducted the first experiment in DNA computing (bio-molecular computing) in 1994, in which molecular biology instruments were used to solve a portion of the standard path of the Hamiltonian puzzle. Computing with molecules directly was discovered at the time, and it was regarded as a new discipline in terms of science defense [26]. The satisfaction problem (SAT), an NP-complete problem, was solved using DNA


**Figure 5.** *Codon and amino acid table [22].*


**S.No Reference Strengths Weaknesses**

• Length of Stego DNA is longer than length DNA of comparison. • The payload does not equal zero. • In the extraction process, multiple

• The amino acid function is not

• The payload does not equal zero. • Modification rate is high. • The algorithm is not blind. • Steganography method for purely

• After the embedding process, the length of DNA is modified.

• The amino acid function is not

• The DNA reference determines the

• Increase the size of the message. • The algorithm is not blind. • Steganography method for purely

• The algorithm is not blind. • Steganography method for purely

obscuring results. • Modification rate is high.

level of security.

obscuring results.

preserved.

preserved.

Does not encrypt confidential information when storing it.

• Increase the length of the stego DNA. • The biological DNA's versatility is not

• The biological DNA's versatility is not

• It must send many data to the recipient in order to retrieve the hidden message from Stego DNA. • The payload is not empty.

• The algorithm is not blind. • Increase the level of redundancy • Steganography method for purely

data is needed.

obscuring results.

obscuring results.

preserved.

preserved.

• High embedding capacity. • Simple to bring into practice. • Modification rate is low.

*DNA Computing Using Cryptographic and Steganographic Strategies*

*Complementary Technique* • Simple to bring into practice. • To break the hidden data, attackers must have a ton of information.

*Substitution Technique* • High embedding capacity. • Simple to bring into practice. • The payload is set to zero. • In contrast to previous approaches, this one is more efficient, dynamic,

and performs better.

• High embedding capacity. • Simple to bring into practice. • Maintain the biological DNA's

• To increase the degree of secrecy and complexity, the consequence of hiding data in the cloud is being

• Preserve the DNA's versatility. • The algorithm is blind. • A secret key is employed.

created between DNA codons and

• Before hiding, use the playfair cipher to encrypt the hidden letter. • Improve the playfair cipher by changing it to 5\*5 to prevent its pitfalls, such as the diagraphs and hidden text form remaining after

• Adding a second layer of protection.

• Capacity and time efficiency are also

• Provide a high risk of cracking. • It is necessary to use a hidden key.

replacement process has been

2 Ref [21] • The payload is set to zero.

features.

implemented.

3 Ref [25] • Build a steganography method that is reversible.

4 Ref [18] • To provide security, a map was

amino acids.

encryption.

improved.

improved.

5 Ref [32] • The usefulness of the initial

**101**

• Algorithm for the blind.

1 [24] *Insertion Technique*

*DOI: http://dx.doi.org/10.5772/intechopen.97620*

**Table 1.**

*Binary code of DNA.*

computing in a 1995 study by Lipton. The offered approach took advantage of DNA's parallelism and its computational and storage capacities [19]. In 1997, Ogihara and Ray discovered that DNA could be used to simulate AND and OR gates [27]. Clelland [28] proposed the first successful experiment of a DNA steganography technique for concealing sensitive data using DNA microdots.

### **2.3 Binary code of DNA**

A, C, G, and T are the four chemical bases that make up each DNA chain. A is biologically related to T, while C is related to G. T The synthesis of DNA rules can be modified in binary arithmetic by changing input judgments, such as assuming that T is related to C or T is related to G [29]. Researchers would use a binary encoding rule to translate a hidden message into DNA rules before mixing it with sequenced DNA to store data in DNA particles. For each rule (A), researchers may use the corresponding binary form: binary formulas can be "00," "01," "10," or "11." This can be expressed as in **Table 1**. The encoding of DNA and its random properties make it an ideal candidate for both coding and coding. As a result, converting DNA into the binary form will result in 4! = 24 different encoding methods [30, 31]. On DNA bases, logical operations such as addition, subtraction, XOR, AND, OR, and NOT are possible.

#### **3. Comparative study**

The aim of the comparison presented in this study is to ensure that researchers are aware of the shortcomings in current steganography systems, thus inspiring future advances in this field. **Table 2** compares the strengths and disadvantages of existing algorithms in terms of security problems such as chance of intrusion, double security layer, blindness, and more.

The derived comparison in **Table 2** aims to clarify the proposed DNA's strengths and weaknesses using data hiding algorithms. Encrypting sensitive data into encryption data before embedding, rather than including the initial data format, improves confidentiality [13, 18, 23, 34, 36, 38, 41, 44, 45, 47–49, 51, 52, 55, 57–60]. Playfair technology, adopted in [58], is the most promising encryption technology combined with DNA-based data masking technology. A thorough comparison of several encryption methods, including vigenere and Playfair, AES, and RSA ciphers, has been done in their work. Any of them was paired with a replacement tool for hiding data in DNA. The findings revealed that the Playfair cipher is not only quick and easy to use, but it also has a high level of protection and ability.

The blindness trait, which eliminates the need to give the original DNA connection to the recipient, is the primary function supported by DNA-based data masking techniques. The main goal of the blindness feature is to improve protection and avoid any intruder way of detecting it, as shown in [11, 18, 25, 35, 41, 43, 48, 49, 51, 57, 58, 62].


computing in a 1995 study by Lipton. The offered approach took advantage of DNA's parallelism and its computational and storage capacities [19]. In 1997, Ogihara and Ray discovered that DNA could be used to simulate AND and OR gates [27]. Clelland [28] proposed the first successful experiment of a DNA steganogra-

**DNA base Binary code** A 00 C 01 G 10 T 11

A, C, G, and T are the four chemical bases that make up each DNA chain. A is biologically related to T, while C is related to G. T The synthesis of DNA rules can be modified in binary arithmetic by changing input judgments, such as assuming that T is related to C or T is related to G [29]. Researchers would use a binary encoding rule to translate a hidden message into DNA rules before mixing it with sequenced DNA to store data in DNA particles. For each rule (A), researchers may use the corresponding binary form: binary formulas can be "00," "01," "10," or "11." This can be expressed as in **Table 1**. The encoding of DNA and its random properties make it an ideal candidate for both coding and coding. As a result, converting DNA into the binary form will result in 4! = 24 different encoding methods [30, 31]. On DNA bases, logical operations such as addition, subtraction, XOR, AND, OR, and

The aim of the comparison presented in this study is to ensure that researchers are aware of the shortcomings in current steganography systems, thus inspiring future advances in this field. **Table 2** compares the strengths and disadvantages of existing algorithms in terms of security problems such as chance of intrusion,

The derived comparison in **Table 2** aims to clarify the proposed DNA's strengths

The blindness trait, which eliminates the need to give the original DNA connection to the recipient, is the primary function supported by DNA-based data masking techniques. The main goal of the blindness feature is to improve protection and avoid any intruder way of detecting it, as shown in [11, 18, 25, 35, 41, 43, 48, 49, 51, 57, 58, 62].

and weaknesses using data hiding algorithms. Encrypting sensitive data into encryption data before embedding, rather than including the initial data format, improves confidentiality [13, 18, 23, 34, 36, 38, 41, 44, 45, 47–49, 51, 52, 55, 57–60]. Playfair technology, adopted in [58], is the most promising encryption technology combined with DNA-based data masking technology. A thorough comparison of several encryption methods, including vigenere and Playfair, AES, and RSA ciphers, has been done in their work. Any of them was paired with a replacement tool for hiding data in DNA. The findings revealed that the Playfair cipher is not only quick

and easy to use, but it also has a high level of protection and ability.

phy technique for concealing sensitive data using DNA microdots.

**2.3 Binary code of DNA**

**Table 1.**

*Binary code of DNA.*

*Data Integrity and Quality*

NOT are possible.

**100**

**3. Comparative study**

double security layer, blindness, and more.


**S.No Reference Strengths Weaknesses**

*DNA Computing Using Cryptographic and Steganographic Strategies*

• Simple to bring into practice.

• Ensure the biological DNA's functionality is maintained. • Low rate of modification. • The algorithm is blind.

• The secret key is hidden in the DNA guide, which adds to the protection. • After hiding sensitive details, the DNA reference is not extended.

• Before hiding the secret key inside the DNA reference, encrypt it using the

the protein coding DNA (PcDNA). • Data encoding is consistent and near

• Keep track of the codon statistics. • Embedding data came close to being

• Embedding data in DNA in a reliable

and effective manner. • A secret key is employed.

hide hidden data, encrypt it. • High-level surveillance.

• Since hiding in an audio at the last stage would not draw attackers. • Hide the secret data and translate it into an audio file so that it is impossible to show that all data is

• Provide two layers of concealment. • A secret key is employed.

negative intruders using brute force. • Before hiding secret data in host text,

• The embedding power ratio is 100

• Provide two layers of concealment. • Chebyshev maps are used to establish

• In hiding, the substitution method is

15 Ref [38] • Before using the Playfair algorithm to

inside the audio.

16 Ref [38] • Key area is wide enough to resist

encrypt it. • The algorithm is blind.

percent.

used.

**103**

DNA references.

• The public key is used, and the

11 Ref [36] • High embedding capacity.

*DOI: http://dx.doi.org/10.5772/intechopen.97620*

12 Ref [11] • It's easy to bring into effect.

13 Ref [23] • Exhibit DNA amino acids to encrypt hidden records.

RSA algorithm.

capability is high. • Cracking with a high probability.

14 Ref [37] • Preservation of protein translation in

optimal.

perfect.

• Cracking with a low probability

• Cracking with a low probability

• Due to the use of LSB in the hiding operation, the potential is low. • There was no encryption on the confidential data until it was hidden. • Cracking with a low probability.

• Algorithm that is not blind. • Algorithm for simply obfuscating

• Algorithm that is not blind. • A high degree of modification. • The payload is not empty. • The versatility of amino acids is not

• Estimation that is difficult. • Unconstrained ncDNA hiding can be

estimated by intruders.

• The hidden data must be extracted using several data sources. • The algorithm is not blind.

• Calculation is difficult.

maintained.

preserved.

results.

• The biological DNA's versatility is not



**S.No Reference Strengths Weaknesses** • The communication performance of a data hiding device on the internet can

• It needs to submit multiple data, including DNA reference, Stego DNA, secret message site collection, table code, to extract the secret message from Stego DNA. • Modification rate is high. • The algorithm is not blind. • Steganography method for purely

• The biological DNA's versatility is not

• The biological DNA's versatility is not

• The biological DNA's versatility is not

• There is no encryption method used. • Only nucleotides with marks equal to zeros after conversion to binary are used to hide hidden records.

• The biological DNA's versatility is not

• Save the location of each DNA base that contains the hidden data and submit it to the receiver for

• The hidden data's size has been

• Algorithm that is not blind.

• Algorithm that is not blind.

• If the DNA comparison includes a number of repeated nucleotides, the modification rate would be high. • Both the sender and the receiver should be aware of the un-blind algorithm, as well as injective mapping and complementary rules. • Algorithm for simply obfuscating

• The algorithm is not blind.

obscuring results.

preserved.

preserved.

results.

preserved.

preserved.

extraction.

expanded.

• In terms of power and protection, providing better results. • TLSM has been enhanced to allow secret data to be hidden in any series

• The Base-t TLSM and the Extended TLSM (ETLSM) are two methods proposed to increase the efficiency of

encrypted data to limit the use of public keys while maintaining the highest level of reliability. • The payload is set to zero. • A wide embedding capacity. • Using the cutting-edge technology of DNA data hiding, the secret key is hidden inside the DNA reference for

• Capacity has been expanded.

added confidentiality.

• Algorithm is simple. • The ability to cover has been enhanced. Reduce the pace of

modification.

8 Ref [34] • Flexible algorithm that is easy to execute.

extended, the payload is zero.

• In hiding, substitution form is used.

• Encrypt a hidden message using a revamped Playfair algorithm that incorporates DNA and amino acids. • After the hiding process, the length of

• In terms of modification volume, the first and third techniques of Ref [24]

• To encrypt hidden data before hiding it, one of the most efficient encryption techniques (RSA) is used.

DNA does not extend. • It is necessary to use a hidden key. • In hiding, substitution form is used.

have been improved. • The stego DNA is not expanded. • The algorithm is blind.

• Low rate of modification. • The length of stego DNA is not

• A public key is employed.

9 Ref [35] • The algorithm employs three keys.

10 Ref [36] • It's easy to bring into effect.

**102**

increased.

7 Ref [33] • If the length of stego DNA is not

be enhanced.

*Data Integrity and Quality*

the TLSM.

6 Ref [13] • Proposed a protocol for masking

of letters or symbols.


**S.No Reference Strengths Weaknesses** • Increased payload capability thus reducing image distortion. • Until being hidden, sensitive data is encrypted using RC4 encryption. • Provide two layers of concealment. • Develop DNA from the cover image.

*DNA Computing Using Cryptographic and Steganographic Strategies*

• Ensure that there are two levels of

• Several types of data are needed during the extraction process. • The DNA functionality is not

• Steganography method for purely

• Only uppercase letters, lowercase letters, 0, ...., 9, period, and dots) are

• It cannot have any other punctuation

• The biological DNA's versatility is not

• May not keep records of an organism's

• After embedding, lengthen the DNA

obscuring results. • The receiver should be sent substitution rules.

allowed in plain text.

• Modification rate is high.

• There is no encryption.

• The algorithm is not blind. • Algorithm for purely hiding records.

• Cracking with a low probability • The alteration rate would be high if the DNA comparison has several

• The biological DNA's versatility is not

life knowledge.

repetitive bases.

preserved.

reference.

marks in it.

preserved.

maintained.

• AES-128 is used to encrypt secret

• AES has provided a strong degree of

• Before and after encryption, separate operations such as XOR and HASH-512 were performed on sensitive data. • Microdot has DNA embedded it to

• After embedding confidential details, the DNA reference does not extend. • It makes use of two DNA references. • The initial DNA reference's usefulness

• Until embedding plain text, encrypt

• To translate a hidden message to DNA format, build a random codon table. • Because of the insertion technique, there is a lot of duplication.

• Cracking with a high probability.

DNA references are used. • Before hiding the plain text, encrypt

• A secret key is employed. • Cracking with a high probability. • The algorithm is blind.

• A secret key is employed. • Encrypt the hidden message using

• After hiding the hidden data, there was no extension to the DNA

• In concealment, the replacement

• The initial DNA reference's usefulness

Playfair's algorithm.

reference.

form is used. • Modification rate is poor.

was preserved.

• High embedding capacity.

29 Ref [52] • A secret key is employed.

**105**

24 Ref [47] • A secret key is employed.

*DOI: http://dx.doi.org/10.5772/intechopen.97620*

files.

25 Ref [48] • Modification rate is low.

shift. • High ability.

everything.

26 Ref [49] • In the suggested algorithm, three

27 Ref [50] • Any programming language can be used to execute it.

it.

28 Ref [51] • The algorithm is blind.

protection.

protection.

improve security.

was preserved. • Algorithm for blind people. • The non-labeled nucleotides do not

*DNA Computing Using Cryptographic and Steganographic Strategies DOI: http://dx.doi.org/10.5772/intechopen.97620*

**S.No Reference Strengths Weaknesses**

modified to use the secret key. As well as keeping all of Ref [40] high points.

capability and protection have been

• Simple to bring into practice. • Secret data is sent in the (ABCD) • Pure steganography algorithm. • Complex calculation.

• Pure steganography algorithm. • The biological DNA's versatility is not

• If multiplied by 6, if the result is not equal to zero, additional zeros are

• The length of Stego DNA is extended.

• The receiver should obtain a random DNA sequence and a complementary

• There is no encryption on the data

• Redundancy has been increased. • The message size has been increased. • The DNA functionality is not

• Increase the size of stego DNA.

• During the extraction process, the algorithm needs several keys.

• Complex calculation.

• The extraction header and data extractions are two aspects of the

algorithm.

until it is embedded. • Cracking with a low probability • Steganography method for purely

obscuring results.

preserved.

• Pure steganography algorithm. • Cracking with a low probability • Algorithm is not blind.

preserved.

added.

pair law.

17 Ref [39] • Ref [40] algorithm's hidden key was

*Data Integrity and Quality*

18 Ref [41] • The initial replacement technique's

increased. • The algorithm is blind. • Method of replacement has been

improved.

19 Ref [42] • High embedding capacity.

format.

20 Ref [43] • Only the correct value of Stego DNA is sent to the recipient. • High level protection.

generated.

combined. • The algorithm is blind. • A secret key is employed. • Cracking with a high probability

21 Ref [44] • A secret key is employed.

22 Ref [45] • A secret key is employed.

23 Ref [46] • A secret key is employed.

**104**

• High capacity.

• Hackers have a tough time spotting the seeds of the random numbers

• Hackers have a hard time deciding how many packets to split, in addition to the number of DNA message bits and binary in each packet. • The secret message bits and DNA comparison bits are randomly

• Until hiding a secret document, encrypt it with RC4. • Exceptional ability.

• Providing a safe environment. • Provide two layers of concealment. • Build DNA from a picture.

• Classified data protection has increased dramatically. • Extra grids of different sizes may be used to store additional data. • BASE64 encoding is used to encrypt

• Provide two layers of concealment. • Secret text is used to build DNA.

• Since the key of prime duration is between 20 and 40, the possible prime range is 420–440.

confidential info.

• High levels of protection.



This is accomplished by minimizing the requisite data that is transmitted to the recipient as much as possible. One of the strengths is to biologically preserve the DNA relationship's original features during the inclusion step while maintaining a fair data load. The reference DNA is used to mask hidden data while preserving protein processing functions. As shown in [11, 21, 25, 37, 48, 51, 52, 58, 60], some DNA characteristics such as silent mutation and codon repetition can mask details

After most data-masking algorithms, the carrier can experience some distortion. Data masking techniques take care of embedding and embedded data; that is why it is communicated invisibly. As a result, it is important to minimize conveyor distortion. When data is entered into a string of stego DNA, the sequenced DNA's length and the degree of change are used to determine stego DNA precision. The low rate of change and lack of expansion rate results in high-quality DNA, which attracts less interest from potential attackers. [11, 33, 35, 36, 48, 51] reaches a low modulation frequency.

It is recommended to use a two-stage steganography technique to hide sensitive data with more detail than previous data masking methods. Using two separate

and alter the genetic sequence without changing the protein chain.

**S.No Reference Strengths Weaknesses** • Until hiding, using various encryption methods and analyzing them to

*DNA Computing Using Cryptographic and Steganographic Strategies*

• The amino acid functionality is not

• A high degree of modification. • Cracking with a low probability

• Different data sets are sent to the receiver for retrieval.

• Non-coding area has a high degree of

maintained.

alteration.

• Algorithm is not blind. • The functionality of DNA is not

• The payload is not empty.

maintained.

• Strong results in a limited period of

• In hiding, the substitution form is

• Until submitting to the recipient, the DNA connection will be hidden in a microdot on a piece of paper. • If the paper is unsafe, recreate a new key and sequence DNA, and the hiding process will start again. • Maintain the DNA sequence's functionality while avoiding

• Random key generator for two levels

• It is necessary to use a hidden key. • The risk of cracking is incredibly

*A comparison of the strengths and weaknesses of DNA steganography techniques.*

choose the best one. • The normal key is used to select English characters to create more stable playfair cipher network. • There is no redundancy in the

operation.

37 Ref [60] • Using the vigenere or playfair cipher, encrypt hidden info. • The sum of data that is hidden is

• High levels of security.

time.

*DOI: http://dx.doi.org/10.5772/intechopen.97620*

used.

doubled.

mutations.

of randomness.

38 Ref [61] • High-level security.

**Table 2.**

**107**

high.

Moreover, the expansion rate characteristic of DNA stego is not achieved at [11, 13, 21, 33–36, 48, 51, 58], which means that the payload is equal to zero.

*DNA Computing Using Cryptographic and Steganographic Strategies DOI: http://dx.doi.org/10.5772/intechopen.97620*


#### **Table 2.**

**S.No Reference Strengths Weaknesses** • Using a modified Playfair algorithm,

• After the hiding process, the length of

• The algorithm is not blind. • Cracking with a low probability

• The algorithm is not blind. • Algorithm for purely hiding records. • Only one part of the cover image is used to hide the DNA message.

• The algorithm is not blind. • On secret records, no encryption technique was used.

• Multiple data are required in the embedding and extraction processes.

• The algorithm is not blind. • Algorithm for purely hiding records. • The extraction method necessitates the use of numerous data sources.

preserved.

• The biological DNA's versatility is not

• It's not easy to put into practice. • Modification rate is high.

• Algorithm is not blind.

• Easy, fast to implement, and performs

• Ref [32] hiding mechanism has been

• In hiding, the substitution form is

• Before hiding a hidden message,

• Provide two layers of concealment.

• Without distorting the picture, two secret images may be hidden within

• Provide two layers of concealment.

• By reducing picture noise bits, the double carrier has been improved. • Enable for a fair amount of space. • Using a two-dimensional 2D logistic map with many parameters. • RC4 is a cryptographic algorithm that is used to encrypt sensitive

• Provide two layers of concealment. • Image is used to create DNA. • A secret key is employed. • In hiding, the substitution form is

• Method that is both safe and efficient. • Until embedding, encrypt hidden data using the RSA algorithm. • Provide two layers of concealment. • A public key is employed.

• The length of stego DNA is not

of any form and dimension.

• The hidden data is encrypted using

• Reed-Solomon (RS) programming is used to measure and correct errors.

encrypt a secret letter.

DNA does not extend.

better than Ref [32].

improved.

imperceptible.

encrypt it.

used.

30 Ref [53] • Technique that is almost

*Data Integrity and Quality*

31 Ref [54] • A secret key is employed.

it.

32 Ref [55] • Protection has been improved.

information.

imperceptible. • This is an effective method. • By hiding in a random video frame, you can have protection. • Provide two layers of concealment.

35 Ref [58] • Keeping track of an organism's life records.

increased.

XOR and PRBG.

36 Ref [59] • The hidden data and the key may be

**106**

used.

33 Ref [56] • Technique that is almost

34 Ref [57] • The algorithm is blind.

*A comparison of the strengths and weaknesses of DNA steganography techniques.*

This is accomplished by minimizing the requisite data that is transmitted to the recipient as much as possible. One of the strengths is to biologically preserve the DNA relationship's original features during the inclusion step while maintaining a fair data load. The reference DNA is used to mask hidden data while preserving protein processing functions. As shown in [11, 21, 25, 37, 48, 51, 52, 58, 60], some DNA characteristics such as silent mutation and codon repetition can mask details and alter the genetic sequence without changing the protein chain.

After most data-masking algorithms, the carrier can experience some distortion. Data masking techniques take care of embedding and embedded data; that is why it is communicated invisibly. As a result, it is important to minimize conveyor distortion. When data is entered into a string of stego DNA, the sequenced DNA's length and the degree of change are used to determine stego DNA precision. The low rate of change and lack of expansion rate results in high-quality DNA, which attracts less interest from potential attackers. [11, 33, 35, 36, 48, 51] reaches a low modulation frequency. Moreover, the expansion rate characteristic of DNA stego is not achieved at [11, 13, 21, 33–36, 48, 51, 58], which means that the payload is equal to zero.

It is recommended to use a two-stage steganography technique to hide sensitive data with more detail than previous data masking methods. Using two separate

vectors in the same manner, increases confidentiality and makes it difficult for criminals to ingest or recover hidden data. Several methods [38, 44, 46, 54–57, 62] used the ref. DNA with another multimedia player to cover the hidden data. Some built DNA from cover images or confidential information, as shown in [44–46, 55, 62], while others used a random sample or selected from an online database, as shown in [38, 54–57].

storage. DNA's bio-molecular computing capabilities are being used in cryptography and steganography. This research compares some recent DNA-based steganography algorithms and points out their security flaws. Each algorithm's advantages and disadvantages are also listed. Some crucial issues are discussed in terms of chance breaking, double layer security, single and double hiding layers, blindness, biologically retained DNA, alteration rate, an extension of DNA comparison, not a pure algorithm, substituting operation, and capacity. This study's comparison aims to provide researchers with the information they need to perform future tasks on

more effective and accurate stable DNA steganography techniques.

*DNA Computing Using Cryptographic and Steganographic Strategies*

*DOI: http://dx.doi.org/10.5772/intechopen.97620*

"The authors declare no conflict of interest."

**Conflict of interest**

**Author details**

Puducherry, India

**109**

\* and Santhi G.2

provided the original work is properly cited.

\*Address all correspondence to: adithya27.07@pec.edu

College, Puducherry, India

1 Department of Computer Science and Engineering, Pondicherry Engineering

2 Department of Information Technology, Pondicherry Engineering College,

© 2021 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/ by/3.0), which permits unrestricted use, distribution, and reproduction in any medium,

Adithya B.<sup>1</sup>

The main factor is one of the most important aspects of data masking strategies. Data masking schemas are centered on the key used and can be classified into three categories. As shown in [21, 24, 32, 33, 40–42, 48, 50, 53, 56], pure data masking is less reliable because it does not use any key. As a result, using a key increases the device's usability by complicating the data-masking mechanism attack. Even if the perpetrators figure out what data-masking scheme is being used, they are unable to retrieve it. The carrier's sensitive information is not protected by the key. The secret is only in the hands of the sender and receiver. As a result, it is advisable to use a strong key when encrypting files, which ensures a more stable method. The second form is the hidden key [11, 13, 18, 25, 34, 35, 37–39, 43–47, 49, 51, 52, 54, 55, 58–61], which was accomplished in [11, 13, 18, 34, 35, 37–39, 43–47, 49, 51, 52, 54, 55, 58, 59]. The third form is classified as a public key, as shown by [23, 36, 57]. The public key is more secure than the private key in general, but it is still slower.

The probability of splitting the code and accessing confidential, sensitive data is known as the algorithm-cracking potential. Studying the probability of a striatum fracture aims to identify the variables that ensure that the risk of rupture is reduced. The likelihood of a leak is determined by the inclusion of certain unknown variables in the algorithm used to mask sensitive data, not by the amount of attempts made before the attacker gained access to the secret data. High probability penetration leads to high protection of the data-masking strategy described in [18, 23, 43, 48, 49, 58, 61]. The replacement strategy is believed to be a more powerful means of concealing data in DNA. The DNA sequence length can be preserved using this process as long as the payload is kept at zero. It also has more power as seen in [32–34, 41, 51, 52, 55, 59, 62], because it substitutes certain DNA nucleotides with cached data blocks or other nucleotides based on confidential data.

Capacity is a vital aspect of any data masking strategy, and it is one of the main criteria for data masking techniques. A steganography strategy must have broad data anonymization potential. This capacity can be measured in absolute terms, such as the hidden message's volume (for example, the data embedding rate, the bit per pixel, the bit per non-zero discrete cosine, the conversion factor, or the ratio of the secret message to a medium). The strength of DNA is calculated in bits per nucleotide (bpn). Thus, one of the main concerns for researchers in this area is improving the potential of secret results, which has previously been accomplished in [13, 18, 21, 23, 32, 33, 40–42, 44, 46, 48, 52, 55, 58–60].

As a result, it can be inferred that the primary goal of DNA-based double-layer masking algorithms is to encode sensitive data before hiding it in a high-power, blind, bio-stored, low moderation rate, load-free algorithm, not a pure method, with a high probability crack. In [48, 51, 58] suggested a low moderation rate, preservation of stretch length DNA for contrast, blindness, preservation of DNA versatility, double layer of security, high strength, and not a pure algorithm.

#### **4. Conclusions**

An increase in storage demand has generated a massive demand for creating new and evolving strategies for storing large amounts of data. DNA has recently been recognized as an efficient data carrier with the additional benefit of dependable data *DNA Computing Using Cryptographic and Steganographic Strategies DOI: http://dx.doi.org/10.5772/intechopen.97620*

storage. DNA's bio-molecular computing capabilities are being used in cryptography and steganography. This research compares some recent DNA-based steganography algorithms and points out their security flaws. Each algorithm's advantages and disadvantages are also listed. Some crucial issues are discussed in terms of chance breaking, double layer security, single and double hiding layers, blindness, biologically retained DNA, alteration rate, an extension of DNA comparison, not a pure algorithm, substituting operation, and capacity. This study's comparison aims to provide researchers with the information they need to perform future tasks on more effective and accurate stable DNA steganography techniques.
