Arithmetic computation using self-assembly of DNA tiles: Integer power over finite field GF(2 n )
作者： Yongnan Li , Limin Xiao
DOI: 10.1109/BIBM.2014.6999202
关键词:
摘要: DNA-based cryptography is a new developing interdisciplinary area which combines cryptography, mathematical modeling, biochemistry and molecular biology. It still an open question that how to implement the arithmetic operations used in cryptosystem based on DNA computing. This paper proposes computing model compute integer power over finite field GF(2n). The computation tiles performing five different functions assemble into seed configuration with inputs figure out result. given be coded bits assembly rules work. time complexity 2n2+n-1 space n4+n3. requires 6436 types of 12 boundary tiles.
sci-hub.se 参考文章(19)
R. Barua, S. Das, Finite field arithmetic using self-assembly of DNA tilings congress on evolutionary computation. ,vol. 4, pp. 2529- 2536 ,(2003) , 10.1109/CEC.2003.1299406
Yuliy Baryshnikov, Ed Coffman, Petar Momčilović, DNA-Based Computation Times DNA Computing. ,vol. 3384, pp. 14- 23 ,(2005) , 10.1007/11493785_2
Yongnan Li, Limin Xiao, Li Ruan, Zhenzhong Zhang, Deguo Li, A DNA Computing System of Modular-Multiplication over Finite Field GF(2n) Algorithms and Architectures for Parallel Processing. pp. 301- 311 ,(2013) , 10.1007/978-3-319-03859-9_26
L. Adleman, Molecular computation of solutions to combinatorial problems Science. ,vol. 266, pp. 1021- 1024 ,(1994) , 10.1126/SCIENCE.7973651
Yongnan Li, Limin Xiao, Li Ruan, Parallel molecular computation of modular-multiplication with two same inputs over finite field GF(2n) using self-assembly of DNA tiles Computational Biology and Chemistry. ,vol. 50, pp. 82- 87 ,(2014) , 10.1016/J.COMPBIOLCHEM.2014.01.004
Yongnan Li, Limin Xiao, Li Ruan, Aihua Liang, Arithmetic Computation Using Self-Assembly of DNA Tiles: Modular-Square over Finite Field GF(2n) 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing. pp. 490- 495 ,(2013) , 10.1109/HPCC.AND.EUC.2013.76
Majid Darehmiraki, Hasan Mishmast Nehi, Molecular solution to the 0–1 knapsack problem based on DNA computing Applied Mathematics and Computation. ,vol. 187, pp. 1033- 1037 ,(2007) , 10.1016/J.AMC.2006.09.020
Hao Wang, Proving Theorems by Pattern Recognition - II Bell System Technical Journal. ,vol. 40, pp. 1- 41 ,(1961) , 10.1002/J.1538-7305.1961.TB03975.X
Li Ruan, Limin Xiao, Yongnan Li, Parallel molecular computation of modular-multiplication based on tile assembly model international conference on parallel and distributed systems. pp. 645- 650 ,(2013) , 10.1109/.114
Qi Ouyang, Peter D Kaplan, Shumao Liu, Albert Libchaber, DNA Solution of the Maximal Clique Problem Science. ,vol. 278, pp. 446- 449 ,(1997) , 10.1126/SCIENCE.278.5337.446