DNA Algorithm of Verifiable Secret Sharing

According to estimate, when n>30, it seems impossible that compute Hamilton problem etc. For solving this lager and more complications problems, we apply LZW coding method, and put forward the DNA algorithm of the verifiable secret sharing. Every participant is regarded as a point and any participantspsila transmission is an edge. So, a known secret sharing problem is being a directed shortest path problem. Both encoding for vertices and edges with DNA methods is introduced, and the basic biochemical processing and the extraction making the result visible is described. The algorithm is satisfied with cryptographic supposition, and it can recovery the secret or find out the adversaries from getting the secret efficiently. On the basis of the experiment of molecular biology, the algorithm is an effective method.