Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division

Xingyi Zhang, Yunyun Niu, Linqiang Pan and Mario J. Pérez-Jiménez
Additional contact information
Xingyi Zhang: Anhui University, China
Yunyun Niu: Huazhong University of Science and Technology, China
Linqiang Pan: Huazhong University of Science and Technology, China
Mario J. Pérez-Jiménez: University of Sevilla, Spain

International Journal of Natural Computing Research (IJNCR), 2011, vol. 2, issue 3, 49-60

Abstract: Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer was given by P. W. Shor in 1997. In this work, it is considered as a function problem, and in the framework of tissue P systems with cell division, a linear-time solution to prime factorization problem is given on biochemical computational devices – tissue P systems with cell division, instead of computational devices based on the laws of quantum physical.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jncr.2011070105 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jncr00:v:2:y:2011:i:3:p:49-60

Access Statistics for this article

International Journal of Natural Computing Research (IJNCR) is currently edited by Xuewen Xia

More articles in International Journal of Natural Computing Research (IJNCR) from IGI Global
Bibliographic data for series maintained by Journal Editor ().