Michael Ho
National Taipei University
15 Papers
256 Citations
Michael Ho is an academic researcher from National Taipei University. The author has contributed to research in topics: Cryptosystem & Hamiltonian path problem. The author has an hindex of 8, co-authored 15 publications. Previous affiliations of Michael Ho include Ming Chuan University & National Taiwan University.
Chat about Author
Papers
Fast parallel molecular algorithms for DNA-based computation: factoring integers
TL;DR: To factor the product of two large prime numbers, is a breakthrough in basic biological operations using a molecular computer and indicates that the cryptosystems using public-key are perhaps insecure and presents clear evidence of the ability of molecular computing to perform complicated mathematical operations.
97
Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing
Minyi Guo,Michael Ho,Weng-Long Chang +2 more
- 01 Sep 2004
TL;DR: Some DNA based parallel algorithms are proposed using the operations in Adleman-Lipton model, together with the analysis of the computational complexity for DNA parallel algorithms.
40
Towards solution of the set-splitting problem on gel-based DNA computing
TL;DR: This paper proves how to apply sticker in the sticker-based model to construct solution space of DNA in the set-splitting problem and how to applies DNA operations in the Adleman-Lipton model to solve that problem from the solutionspace of sticker.
35
Fast parallel DNA-based algorithms for molecular computation: discrete logarithm
TL;DR: This work proposes DNA-based algorithms that formally verify the designed molecular solutions for solving the problem of discrete logarithms, and indicates that public-key cryptosystems based on the difficulty of solving the Problem of discrete Logarithm are perhaps insecure.
21
Molecular solutions of the RSA public-key cryptosystem on a DNA-based computer
TL;DR: Five DNA-based algorithms are proposed that construct molecular solutions for any (plain-text, cipher-text) pair for the RSA public-key cryptosystem and it is demonstrated that an eavesdropper can decode anencrypted message overheard with the linear steps in the size of the encrypted message overheard.
21