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

TitleLinear Time Solution to Prime Factorization by Tissue P Systems with Cell Division
Publication TypeJournal Papers
Year of Publication2011
AuthorsZhang, X., Niu Y., Pan L., & Pérez-Jiménez M. J.
Journal TitleInternational Journal of Natural Computing Research
PublisherIGI Global
Place PublishedHershey, Pennsylvania (USA)
Volume2
Pages49-60
Date Published07/2011
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.

Keywordscryptography, Membrane computing, Polynomial-Time Algorithm, Prime Factorization, Tissue P System
URLhttp://www.igi-global.com/article/linear-time-solution-prime-factorization/58066
Issue3
ISSN Number1947-928X
DOI10.4018/jncr.2011070105