本项目研究面向密码学问题的DNA计算算法，并分析其对传统密码体制的影响。由于现有基础计算模块的DNA算法难以进行连续运算，故不能直接应用于密码系统与密码分析。本课题将对这一现状进行研究，解决现有DNA计算不能进行连续运算的关键问题，并设计模乘、最大公约数与离散对数的DNA算法。.本项目所研究的离散对数DNA算法并非传统算法（如Shanks，Pollig-Hellman等）的生物模拟，而是另外设计一套符合生物特性的计算流程，并充分利用DNA的大规模并行优势。在此基础上，本项目将分析DNA离散对数算法与传统算法的性能差异，并分析其对传统密码体制安全性的影响。 .由于离散对数问题是密码学中的关键问题，本项目的研究结果将对新型计算模式下的密码学研究提供重要的理论依据。同时，本项目的研究也将对密码学和生物学的学科发展产生积极的影响。

This project focuses on the research of DNA computing in the framework of cryptography and its impact on conventional cryptosystem. Existing DNA algorithms could not be applied directly in cryptosystem or cryptanalysis, since the combination of such algorithms cannot be applied continuously without interruption. This project aims to overcome this barrier and develop DNA algorithms for modular multiplication, great common divisor and discrete logarithm. Other than using molecular biological methods to simulate the procedure of conventional algorithms (Shanks, Pollig-Hellman, etc.), we will use a completely different approach to design the algorithm, thus the algorithm would coincide with the characteristic of DNA reaction and take full advantage of its massive parallelism. We will also compare our discrete logarithm DNA algorithm with the conventional algorithms and analyze its impact on conventional cryptosystem...Due to the importance of discrete-logarithm in cryptography, the research of this project will provide theoretical basis of the crypto-analysis in new computing model. Moreover, this research could also have a positive impact on both cryptography and biology.