# Novel Algorithm for Multi-Time Data Implantation in a Special Cyber-Manufacturing Architecture
## 5 Analysis of Proposed Method
### Boosting Up Vulnerability  
One noticeable point of the scheme is that the cover DNA is found at the first block of \(\hat{N}_{x}\). The same is true in the case of RNA. According to the above example, cover DNA is TTTGTTGAGT. As the cover DNA is always found as a first block of \(\hat{N}_{x}\), in case of stolen key, it cannot preserve the security of cover DNA. Therefore, we introduce a shuffling policy \begin{table}
\begin{tabular}{c c c c c c c c c c c c} \hline \hline \(R_{1}\) & 10 & 01 & 11 & 11 & 11 & 11 & 00 & 11 & 10 & 00 \\ \hline \(R_{2}\) & 01 & 10 & 11 & 10 & 00 & 00 & 00 & 01 & 10 & 00 \\ \hline \(S\) & 00 & 00 & 11 & 11 & 00 & 01 & 11 & 00 & 00 & 01 \\ \hline \multicolumn{10}{c}{Equation (5): \(M_{1}=R_{1}\oplus R_{2}\oplus S\)} \\ \hline \(M_{1}\) & 11 & 11 & 11 & 10 & 00 & 10 & 11 & 10 & 00 & 01 \\ \hline \multicolumn{10}{c}{Using Equation (6), \(M\) is computed.} \\ \multicolumn{10}{c}{\(M=M_{1}=11\)-11-11-10-00-10-11-10-00-01} \\ \multicolumn{10}{c}{2. Execution cycle 2: Now, again, using Equations (3)–(5), we compute \(R_{1}\), \(R_{2}\) and \(M_{1}\).} \\ \multicolumn{10}{c}{In this cycle, the value of \(M_{1}\) is the same as the value of \(M_{2}\) in the data implantation module. The result is depicted in Table 7} \\ \multicolumn{10}{c}{\(R_{1}=\) 01-10-11-10-00-00-00-01-10-00} \\ \multicolumn{10}{c}{\(R_{2}=\) 01-00-01-10-01-10-10-10-11-00} \\ \hline \multicolumn{10}{c}{Equation (6) gives:} \\ \multicolumn{10}{c}{\(M=M_{1}\parallel M=00\)-10-01-11-01-11-01-11-01-01 \(\parallel\) 11-11-11-10-00-10-11-10-00-01} \\ \multicolumn{10}{c}{3. Execution cycle 3: Using Equations (3)–(5), we can compute \(R_{1}\), \(R_{2}\) and \(M_{1}\).} \\ \multicolumn{10}{c}{the same as the \(M_{1}\) of the data implantation module. The result is depicted in Table 8} \\ \multicolumn{10}{c}{\(R_{1}=\) 01-00-01-10-01-10-10-10-11-00} \\ \multicolumn{10}{c}{\(R_{2}=\) 11-11-11-10-11-11-10-00-10-11 Equation (6) yields:} \\ \multicolumn{10}{c}{\(M=M_{1}\parallel M=10\)-11-01-11-10-00-11-10-01-10 \(\parallel\) 00-10-01-11-01-11-01-01-11-11-10-00-01} \\ \multicolumn{10}{c}{After the execution of the \(i\) loop in the data extraction part of the Method, we will find \(R=R_{2}\). Hence, \(R=\) 11-11-11-10-11-11-10-00-10-11, DNA conversion of \(R\) is \(N_{r}=\) TTTGAGT. Thus, the scheme retrieves the hidden message and rebuilds the cover DNA/RNA.} \\ \hline \hline \end{tabular}
\end{table} 
Table 7: Results of execution cycle 2 in the data extraction module. \begin{table}
\begin{tabular}{c c c c c c c c c c c} \hline \hline \(R_{1}\) & 01 & 00 & 01 & 10 & 01 & 10 & 10 & 10 & 11 & 00 \\ \hline \(R_{2}\) & 11 & 11 & 11 & 10 & 11 & 11 & 10 & 00 & 10 & 11 \\ \hline \(S\) & 00 & 00 & 11 & 11 & 00 & 01 & 11 & 00 & 00 & 01 \\ \hline \multicolumn{10}{c}{Equation (5): \(M_{1}=R_{1}\oplus R_{2}\oplus S\)} \\ \multicolumn{10}{c}{\(M=M_{1}\parallel M=10\)-01-11-10-00-11-10-01} \\ \multicolumn{10}{c}{11-11-11-10-00-10-11-10-00-01} \\ \multicolumn{10}{c}{After the execution cycle 3: Using Equations (3)–(5), we can compute \(R_{1}\), \(R_{2}\) and \(M_{1}\).} \\ \multicolumn{10}{c}{the same as the \(M_{1}\) of the data implantation module.} \\ \multicolumn{10}{c}{\(R_{1}=\) 01-00-01-10-10-10-10-11-00} \\ \multicolumn{10}{c}{\(R_{2}=\) 11-11-11-10-11-10-00-10-11 Equation (6) yields:} \\ \multicolumn{10}{c}{\(M=M_{1}\parallel M=10\)-11-01-11-10-00-11-1-0-01-10 \(\parallel\) 00-10-0-01-1-11-01-1-01-11-11-10-00-01} \\ \multicolumn{10}{c}{After the execution of the \(i\) loop in the data extraction part of the Method, we will find \(R=R_{2}\). Hence, \(R=\) 11-11-11-10-11-11-10-00-10-11, DNA conversion of \(R\) is \(N_{r}=\) TTTGAGT. Thus, the scheme retrieves the hidden message and rebuilds the cover DNA/RNA.} \\ \multicolumn{10}{c}{\(M_{1}=\) 01} \\ \multicolumn{10}{c}{\(M_{1}\)} \\ \multicolumn{10}{c}{Results of execution cycle 3 in the data extraction module.}