# P System Design for Integer Factorization
## 2 Foundation
### Extended P System
Available online: [[https://citeseer.ist.psu.edu/document?repid=rep1&type=pdf&doi=9095558d493590](https://citeseer.ist.psu.edu/document?repid=rep1&type=pdf&doi=9095558d493590) de047 aa4 af8f4 ceba8043 dcac2]([https://citeseer.ist.psu.edu/document?repid=rep1&type=pdf&doi=9095558d493590](https://citeseer.ist.psu.edu/document?repid=rep1&type=pdf&doi=9095558d493590) de047 aa4 af8f4 ceba8043 dcac2) (accessed on 3 January 2023). * [PERSON] and [PERSON] (2014) [PERSON]; [PERSON] Modeling Framework for Membrane Computing in Biological Systems: Evaluation with a Case Study. _J. Comput. Sci._**2014**, \(5\), 137-143. [CrossRef]
* [PERSON] and [PERSON] (2016) [PERSON]; [PERSON] [PERSON] A New Membrane Algorithm Using the Rules of Particle Swarm Optimization Incorporated within the Framework of Cell-like P Systems to Solve Sudoku. _Appl. Soft Comput._**2016**, _45_, 27-39. [CrossRef]
* [PERSON] et al. (1978) [PERSON]; [PERSON]; [PERSON] A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. _Commun. ACM_**1978**, _21_, 120-126. [CrossRef]
* [PERSON] (1998) [PERSON] An Introduction to the General Number Field Sieve. Ph.D. Thesis, Virginia Tech, Blacksburg, VA, USA, 1998. Available online: [[http://hdl.handle.net/10919/36618](http://hdl.handle.net/10919/36618)]([http://hdl.handle.net/10919/36618](http://hdl.handle.net/10919/36618)) (accessed on 14 February 2023). * [PERSON] and [PERSON] (2009) [PERSON]; [PERSON] Revisiting Fermat's Factorization for the RSA Modulus. _arXiv_**2009**, arXiv:0910.4179. * [PERSON] et al. (2007) [PERSON]; [PERSON]; [PERSON] Solving the Factorization Problem with P Systems. _Prog. Nat. Sci._**2007**, _17_, 471-478. [CrossRef]
* [PERSON] and [PERSON] (2012) [PERSON]; [PERSON] Arithmetic Operations and Factorization Using Asynchronous P Systems. _IJNC_**2012**, \(2\), 217-233. [CrossRef] [PubMed* [15] [PERSON] On P Systems with Active Membranes Solving the Integer Factorization Problem in a Polynomial Time. In _Proceedings of the Multiset Processing_; [PERSON], [PERSON], [PERSON], [PERSON]; Springer: Berlin, Heidelberg, 2001; pp. 267-285. * [16] [PERSON]; [PERSON]; [PERSON]; [PERSON] Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division. _Nat. Comput. Simul. Knowl. Discov._**2014**, 207-220. * [17] [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] A Uniform Solution to Integer Factorization Using Time-Free Spiking Neural P System. _Neural Comput. Appl._**2015**, 26, 1241-1247. [CrossRef]
* [18] [PERSON] Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In Proceedings of the 35 th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, 20-22 November 1994; pp. 124-134. * [19] [PERSON] Computing with Membranes (P Systems): A Variant. _Int. J. Found. Comput. Sci._**2000**, 11, 167-181. [CrossRef]
* [20] [PERSON]; [PERSON]; [PERSON]; [PERSON] Membrane Systems with Promoters/Inhibitors. _Acta Inform._**2002**, 38, 695-720. [CrossRef]
* [21] [PERSON]; [PERSON] Is the Euclidean Algorithm Optimal Among Its Peers? _Bull. Symb. Log._**2004**, 10, 390-418. [CrossRef]
* [22] [PERSON]; [PERSON]; [PERSON] UPSimulator: A General P System Simulator. _Knowl.-Based Syst._**2019**, 170, 20-25. [CrossRef]
* [23] [PERSON]; [PERSON] An Empirical Comparison of the Quadratic Sieve Factoring Algorithm and the Pollard Rho Factoring Algorithm. _arXiv_**2021**, arXiv:2111.02967. * [24] [PERSON]; [PERSON]; [PERSON]; [PERSON] The Space Complexity Analysis in the General Number Field Sieve Integer Factorization. _Theor. Comput. Sci._**2016**, 630, 76-94. [CrossRef]

**Disclaimer/Publisher's Note:** The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.