Breaking the Diffie-Hellman key exchange algorithm in the tile assembly model

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 31, Issue 12, 2008, Pages 2116-2122

  Chen, Zhi Hua ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Discrete logarithm; DNA computing; DNA self assembly model; Integers permutation; PCR

Indexed keywords

DNA; ELECTROPHORESIS;

DIFFIE-HELLMAN KEY EXCHANGE; DISCRETE LOGARITHMS; DNA SELF-ASSEMBLY MODEL; DNA-COMPUTING; GEL ELECTROPHORESIS; INTEGERS PERMUTATION; LOGICAL OPERATIONS; TILE ASSEMBLY MODELS;

POLYMERASE CHAIN REACTION;

EID: 58149307477     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: 10.3724/sp.j.1016.2008.02116     Document Type: Article

References (22)

1. Adleman L M. Molecular computation of solutions to combinatorial problems. Science, 1994, 266: 1021-1024
2. Adleman L M. Computing with DNA. Scientific American, 1998, 279(2): 54-61
3. Liu L Q, Liu G W, Xu J, Liu Y C. Solid phase based DNA solution of the coloring problem. Progress in Natural Science, 2004, 14(5): 104-107
4. Pan L Q, Carlos M V. Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes. Journal of Parallel and Distributed Computing, 2005, 65(12): 1578-1584
5. Boneh D, Dunworth C, Lipton R J. Breaking DES using a molecular computer//Proceedings of the 1st DIMACS Workshop on DNA Based Computers. 1995: 37-65
6. Adleman L M, Rothemund P W K, Roweis S, Winfree E. On applying molecular computation to the data encryption standard//Proceedings of the 2nd Annual Meeting on DNA Computers. 1996: 10-12
7. Chang W L, Guo M Y, Michael S H. Fast parallel molecular algorithms for DNA-based computation: Factoring integers. IEEE Transactions on Nanobioscience, 2005, 4(2): 149-163
8. Gehani A, LaBean T H, Reif J H. DNA-based cryptography//Proceedings of the 5th DIMACS Workshop on DNA-Based Computers, MIT, 1999: 233
9. Leier A, Richter C, Banzhaf W, Rauhe H. Cryptography with DNA binary strands. Biosystems, 2000, 57: 13-22
10. Chen J. A DNA-based biomolecular cryptography design//Proceedings of the 2003 International Symposium on Circuits and Systems: ISCAS 2003, 2003: 822
11. Clelland C T, Risca V, Bancroft C. Hiding messages in DNA microdots. Nature, 1999, 399: 533-534
12. Wang H. Proving theorems by pattern recognition I. Bell System Technical Journal, 1961, 40: 1-42
13. Mao C, LaBean T H, Reif J H, Seeman N C. Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature, 2000, 407: 493-496
14. Barish R, Rothemund P, Winfree E. Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters, 2005, 5(12): 2586-2592
15. Cook M, Rothemund P, Winfree E. Self-assembled circuit patterns//Proceedings of the 10th International Meeting on DNA Computer. Milan, Italy, 2004: 91-107
16. Rothemund P, Papadakis N, Winfree E. Algorithmic self-assembly of DNA sierpinski triangles., 2004, 2(12): 2041-2053
17. Brun Y. Arithmetic computation in the tile assembly model: Addition and multiplication. Theoretical Computer Science, 2006, 378(1): 17-31
18. Brun Y. Nondeterministic polynomial time factoring in the tile assembly model. Theoretical Computer Science, 2008, 395(1): 3-23
19. Brun Y. Solving NP-complete problems in the tile assembly model. Theoretical Computer Science, 2008, 395(1): 31-46
20. Rothemund P, Winfree E. The program-size complexity of self-assembled squares//Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC). Portland, 2001: 459-468
21. Rozenberg G, Spaink H. DNA computing by blocking. Theoretical Computer Science, 2003, 292(3): 653-665
22. LaBean T H, Winfree E, Reif J H. Experimental progress in computation by self-assembly of DNA tilings//Proceedings of the 5th International Meeting on DNA Based Computers (DNA5). MIT, Cambridge MA, 1999: 123-140