# Hash Based DNA Computing Algorithm for Image Encryption
## 3 Methods
### Content-Aware Encryption Module
\begin{table}
\begin{tabular}{c c c c c c c} \hline \hline \multirow{2}{*}{**Crytoysystems**} & \multicolumn{2}{c}{**Correlation**} & \multirow{2}{*}{**Entropy**} & \multicolumn{2}{c}{**Sensitivity**} \\  & **V** & **H** & **D** & & **NPCR** & **UACI** \\ \hline Ours & 0.0032 & 0.0019 & 0.0004 & 7.9982 & 99.6442 & 33.4732 \\ [PERSON] et al. [25] & \(-\)0.0064 & 0.0003 & 0.0110 & 7.9993 & 99.6218 & 33.5084 \\ [PERSON] et al. [23] & 0.000016 & \(-\)0.00003 & \(-\)0.000001 & - & 99.5009 & 33.4408 \\ [PERSON] et al. [28] & 0.0240 & 0.0014 & \(-\)0.0014 & 7.9978 & 99.652 & 33.5871 \\ [PERSON] et al. [29] & \(-\)0.0056 & \(-\)0.0012 & \(-\)0.0020 & 7.9994 & 99.62 & 33.55 \\ \hline \hline \end{tabular}
\end{table} 
Table 5: Results achieved by the proposed method and several comparison methods. comparison methods by obtaining enough capability of resistance to any type of attacks. Therefore, it can be concluded that our method is competitive among these methods. ### Computation Cost Analysis

We compare the computing cost of the proposed method and other DNA computing-based methods in Table 6, thus proving its relatively low computing burden. It's noted that we use color image with \(1024\times 1024\) as input. All programs are deployed with C language and tested on the same devices (two laptops with i7-9750H CPU and 8 GB DDR3 RAM), thus ensuring the fairness of comparisons. It is noted that the encryption and decryption process would cost 0.491 s and 0.507 s with the proposed method, which has certain advantages when comparing to other DNA computing-based methods. ## 5 Conclusions

The proposed method consists of two modules, i.e., DNA hash encoding and content-aware encrypting module. Specifically, the former one builds the quantity of hash mappings from image pixels to DNA computing bases, thus integrating the advantages of the hash function and DNA computing. The latter one considers strong correlations between adjacent pixels as sources of complexity, thus reorganizing the data structure by highly non-linear functions extracted from neighboring pixels and patches. Experimental results demonstrate that the proposed method could achieve a superior performance in various security measurements, compared with several of the latest comparison methods. Our future work includes DNA computing design on medical images a.

Conceptualization, H.L. and L.Z. ; methodology, H.L. and L.Z. ; software, H.C.; validation, H.L., L.Z. and L.Z. ; formal analysis, Y.W. ; investigation, Y.W. ; resources, H.L. ; data curation, L.Z. ; writing--original draft preparation, H.L. and L.Z. ; writing--review and editing, H.L. and Y.W. ; visualization, H.L. and L.Z. ; supervision, Y.W. ; project administration, Y.W. ; funding acquisition, H.L. and Y.W. All authors have read and agreed to the published version of the manuscript. This research was funded by Provincial Ideological and Political Education Research Projects in the Education Department of Zhejiang Province, the Fundamental Research Funds for the Central Universities under Grant B2020202074, the Fundamental Research Funds for the Central Universities, JLU. Not applicable. The data presented in this study are available on request from the corresponding author. The data are not publicly available due to privacy. The authors declare no conflict of interest. ## References

* _[PERSON] et al. (2022)_ [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Digital Twin of Intelligent Small Surface Defect Detection with Cyber-Manufacturing Systems. _ACM Trans. Internet Technol._**2022. ** [CrossRef]
* _[PERSON] et al. (2011)_ [PERSON]; [PERSON]; [PERSON] DNA-based computing of strategic assignment problems. _Phys. Rev. Lett._**2011**, _106_, 188702. [CrossRef]
* [PERSON] (1994) [PERSON] Molecular computation of solutions to combinatorial problems. _Science_**1994**, _266_, 1021-1024. [CrossRef] [PubMed]