| Summary: | Membrane computing is a natural computing branch inspired by the structure of biological cells. The mathematical abstract model of a membrane computing system is called a P System, which is one of the main topics in membrane computing research for the design and verification of a P System. Integer factorization is still a world-class problem and a very important research direction. If a fast method can be found to solve the integer factorization problem, several important cryptographic systems including the RSA public key algorithm will be broken. The aim of this paper is to design a P System capable of implementing integer decomposition, taking advantage of the characteristics of parallelism of P Systems. We construct a process with a main goal to study the modal exponential function <i>f</i>(<i>x</i>) = <i>a<sup>x</sup></i> mod <i>N</i> and explore the possible periodic behavior for different values of <i>a</i>. We attempt to compute nontrivial prime factors by the period found and constrain the operation of the P System in polynomial time.
|
|---|