DNA computation falls into a cross field of biochemistry mathematics and computer, it covers an extensive range. After professor Adleman initiated this new calculative field, The method of DNA computation can widely be used to solve some problem of chart network and optimize. DNA computation can solve some cipher problem because of its highly parallel computation and the dense deposited information of DNA, the present application of DNA computation mainly be involved in one-time pad ciphersystem and data encryption standard(DES). We continue to explore the extensive application of DNA computation in cryptology in our research, our research be involved in knapsack-type public key cryptosystem. the detail content contain two aspects, one aspect is to find the character of the pubic key. The other is to use DNA computation to solve the problem of breaking the knapsack codes. Knapsack problem is a famous NPC problem, there is no effective method to solve this question at present. We first seek about the characteristic of the public-key by the comprehension of the knapsack-type public key cryptosystem in the process of research, then try to find the single answer condition of the Knapsack problem. We extensively collected and read some writings that relate to breaking cipher problem using DNA computation and solving Knapsack problem in the process of seeking after the method to break Knapsack codes , and we got extensively comprehension about the method of the DNA computation and sovling Knapsack problem , then we brought forword two new method, the merit of the first one is that it can reduce the space complexity degree. The other one ameliorates the first one and performs dichotomy, so it can effectively reduce the time complexity and space complexity of the computation. Though the application of DNA computation in cryptology is relativly finite and some DNA computing method and models can not be used in lab, this parallel computing method proposes a new method of computation, it will bring an important... |