A Molecular Computation Model To Compute Inversion Over Finite Field Gf(2(N))

With the advent of DNA computing, some traditional scientific disciplines present new developing orientations. One of them is DNA-based cryptography, a new developing interdisciplinary area which combines cryptography, mathematical modeling, biochemistry and molecular biology. There are some questions worth study that how to implement the arithmetic operations used in cryptosystem based on DNA computing. This paper proposes a DNA computing model to show how to calculate inversion over finite field GF(2(n)) with DNA self-assembly. 4567 types of computation tiles with 7 different functions assemble into the seed configuration with inputs to figure out the solution. The assembly time complexity is Theta(n(2)) and the space complexity is Theta(n(4)).