@article {804,
title = {Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division},
journal = {International Journal of Natural Computing Research},
volume = {2},
year = {2011},
month = {07/2011},
pages = {49-60},
publisher = {IGI Global},
address = {Hershey, Pennsylvania (USA)},
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 {\textendash} tissue P systems with cell division, instead of computational devices based on the laws of quantum physical.},
keywords = {cryptography, Membrane computing, Polynomial-Time Algorithm, Prime Factorization, Tissue P System},
issn = {1947-928X},
doi = {10.4018/jncr.2011070105},
url = {http://www.igi-global.com/article/linear-time-solution-prime-factorization/58066},
author = {Xingyi Zhang and Yunyun Niu and Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez}
}