| ¡¡ | Chinese Journal of Computers Full Text |
| Title | Breaking the Diffie-Hellman Key Exchange Algorithm in the Tile Assembly Model |
| Authors | CHEN Zhi-Hua |
| Address | (Department of Control Science and Engineering, Huazhong University of Science & Technology, Wuhan 430074) |
| Year | 2008 |
| Issue | No.12(2116¡ª2122) |
| Abstract & Background | Abstract Recent experiments have demonstrated that the simple binary arithmetic and logical operations can be computed by the self-assembly DNA tiles. This paper shows how the tile assembly process can be used to break Diffie-Hellman key exchange. In order to achieve this, the author used tile systems to construct the integers permutation from 1 to p-1 based on the truth table of the following numbers modular p:g mod p,g2 mod p,¡,gp-1 mod p. The output of the systems can be read by the standard sequence-reading operation that uses a combination of PCR and gel electrophoresis. Through the processes of tile systems, we can pick out the discrete logarithm result which is the secret key in the Diffie-Hellman algorithm. So the key exchange by Diffie-Hellman algorithm is unsafe. The system can be carried out in ¦¨(p-1) assembly time with ¦¨(p) tiles. The methods extend the applications of self-assembly model. Keywords DNA computing; DNA self-assembly model; discrete logarithm; integers permutation£» PCR |