Ponencia
The Factorization Problem: A New Approach Through Membrane Systems
Autor/es | Orellana Martín, David
Valencia Cabrera, Luis Pérez Jiménez, Mario de Jesús |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2018 |
Fecha de depósito | 2021-04-26 |
Publicado en |
|
Resumen | The factorization problem (given a natural number which is
the product of two prime numbers, find its decomposition) is conjectured
to be intractable and for that it has been used as the key to have secure
current ... The factorization problem (given a natural number which is the product of two prime numbers, find its decomposition) is conjectured to be intractable and for that it has been used as the key to have secure current cryptosystems. Due to its relevance, this problem has been studied in various computational paradigms, in particular in membrane computing. In this framework, recognizer P systems were introduced to deal with decision problems, that is, problems whose solution/answer is either “yes” or “no”. The factorization problem is a search problem (also called function problem), where the question is to identify/find one solution to the set of possible solutions associated with each instance. In this work, membrane systems computing partial functions are shown to (e |
Agencias financiadoras | Ministerio de Economía y Competitividad (MINECO). España National Natural Science Foundation of China |
Identificador del proyecto | TIN2017-89842-P
No 61320106005 |
Cita | Orellana Martín, D., Valencia Cabrera, L. y Pérez Jiménez, M.d.J. (2018). The Factorization Problem: A New Approach Through Membrane Systems. En UCNC 2018: 17th International Conference on Unconventional Computation and Natural Computation (39-56), Fontainebleau, France: University of Paris Est Creteil Val de Marne. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
The factorization problem a new ... | 540.4Kb | [PDF] | Ver/ | |