| 解决NP问题的DNA编码技术 |
| |
| 引用本文： | 霍家佳,刘洪宇,申兵.解决NP问题的DNA编码技术[J].实验科学与技术,2009,7(2):49-52. |
| |
| 作者姓名： | 霍家佳 刘洪宇 申兵 |
| |
| 作者单位： | 1. 现代通信国家重点实验室,成都,610041
2. 电子科技大学研究生院,成都,610054 |
| |
| 基金项目： | 国防科技保密通信实验室基金 |
| |
| 摘 要： | NP问题是密码学中的一个难题,用DNA计算解决NP问题是目前DNA密码研究的一个热点。文章阐述了DNA编码问题及约束条件,归纳出用DNA计算解决NP问题的基本步骤,分析了Adleman解决哈密尔顿回路问题的实验中DNA编码的质量,提出了可选的更好的编码,并总结了目前DNA编码研究中存在的问题。
|
| 关 键 词： | DNA计算 DNA密码 NP问题 DNA编码 |
DNA Encoding Technique in Solving NP Problems |
| |
| HUO Jia-jia,LIU Hong-yu,SHEN Bing.DNA Encoding Technique in Solving NP Problems[J].Experiment Science & Technology,2009,7(2):49-52. |
| |
| Authors: | HUO Jia-jia LIU Hong-yu SHEN Bing |
| |
| Institution: | 1. National Laboratory for Modem Communications, Chengdu 610041, China; 2. Graduation Department, University of Electronic Science and Technology of China, Chengdu, 610054, China) |
| |
| Abstract: | NP problems are hard to deal with in cryptography. Using DNA computing to solve NP problems is a hot spot in current research of DNA cryptography. This article discusses DNA encoding problem and its restriction conditions, concludes basic steps of solving NP problems by using DNA computing. It analyzes the DNA encoding quality in Adleman＇s experiment of solving Hamilton Path Problem, puts forward better encodes for it, and summarizes the existing problems in the research of DNA encoding. |
| |
| Keywords: | DNA computing DNA cryptography NP problem DNA encoding |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
