메뉴 건너뛰기




Volumn , Issue , 2004, Pages 125-133

Fast parallel molecular algorithms for DNA-based computation: Factoring integers

Author keywords

Biological Parallel Computing; DNA based Supercomputing; The RSA Public key cryptosystem

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; CRYPTOGRAPHY; DECODING; MOLECULAR STRUCTURE; PARALLEL PROCESSING SYSTEMS; THEOREM PROVING;

EID: 3142715273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (8)
  • 1
    • 0017930809 scopus 로고
    • A method for obtaining digital signatures and public-key crytosystem
    • R. L. Rivest, A. Shamir and L. Adleman. "A Method for Obtaining Digital Signatures and Public-Key Crytosystem". Com. of the ACM, Vol. 21, pp. 120-126, 1978.
    • (1978) Com. of the ACM , vol.21 , pp. 120-126
    • Rivest, R.L.1    Shamir, A.2    Adleman, L.3
  • 2
    • 0028114541 scopus 로고
    • Molecular computation of solutions to combinatorial problems
    • L. Adleman. "Molecular computation of solutions to combinatorial problems". Sci., pp. 1021-1024, 1994.
    • (1994) Sci. , pp. 1021-1024
    • Adleman, L.1
  • 3
    • 0029278612 scopus 로고
    • DNA solution of hard computational problems
    • R. J. Lipton. "DNA solution of hard computational problems". Sci., 268: 542:545, 1995.
    • (1995) Sci. , vol.268
    • Lipton, R.J.1
  • 4
    • 4544333723 scopus 로고    scopus 로고
    • Is cook's theorem correct for DNA-based computing - Towards solving the NP-complete problems on a DNA-based supercomputer model
    • accepted
    • Michael Ho, Weng-Long Chang and Minyi Guo. "Is Cook's Theorem Correct for DNA-based Computing - Towards Solving the NP-Complete Problems on a DNA-based Supercomputer Model". Journal of Parallel and Distributed Scientific and Engineering Computing, accepted.
    • Journal of Parallel and Distributed Scientific and Engineering Computing
    • Ho, M.1    Chang, W.-L.2    Guo, M.3
  • 5
    • 18844422804 scopus 로고    scopus 로고
    • Solving the set-splitting problem in sticker-based model and the adleman-lipton model
    • It was accepted on
    • W.-L. Chang, M. Guo and M. Ho. "Solving the Set-splitting Problem in Sticker-based Model and the Adleman-Lipton Model". It was accepted on Future Generation Computer System, 2003.
    • (2003) Future Generation Computer System
    • Chang, W.-L.1    Guo, M.2    Ho, M.3
  • 6
    • 0344393603 scopus 로고    scopus 로고
    • Solving the set-cover problem and the problem of exact cover by 3-sets in the adleman-lipton's model
    • W.-L. Chang and M. Guo. "Solving the Set-cover Problem and the Problem of Exact Cover by 3-Sets in the Adleman-Lipton's Model". BioSystems, Vol. 72, No. 3, pp. 263-275, 2003.
    • (2003) BioSystems , vol.72 , Issue.3 , pp. 263-275
    • Chang, W.-L.1    Guo, M.2
  • 7
    • 0842263805 scopus 로고    scopus 로고
    • Molecular solutions for the subset-sum problem on DNA-based supercomputing
    • W.-L. Chang, M. Ho and M. Guo. "Molecular Solutions for the Subset-sum Problem on DNA-based Supercomputing". BioSystems, Vol. 73, No. 2, 2004. pp. 117-130.
    • (2004) BioSystems , vol.73 , Issue.2 , pp. 117-130
    • Chang, W.-L.1    Ho, M.2    Guo, M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.