Small universal improved spiking neural P systems with multiple channels and autapses

Ning, Guimin; Valencia-Cabrera, Luis; Song, Xiaoxiao

doi:10.1007/s41965-022-00100-x

Cited by 3 publications

(1 citation statement)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Membrane computing has been intensively studied. Some of the most recent papers refer to theoretical developments [6][7][8][9][10][11] and applications [12][13][14][15][16]. The possibility of generating exponential space in polynomial (more often linear) time, is a key feature of these models and represents the main element in solving NP-complete problems [17][18][19].…”

Section: Introductionmentioning

confidence: 99%

Breaking RSA Encryption Protocol with Kernel P Systems

Vasile

Gheorghe

Niculescu

2023

Preprint

View full text Add to dashboard Cite

The prime factorisation problem is intractable, i.e., no efficient algorithm is known. In cryptography there are some well-known approaches based on the computational hardness of this problem, including Rivest-Shamir-Adleman (RSA) encryption protocol. Several attemps to break RSA have been investigated, some of them based on the massive parallelism of membrane systems.In this paper a new approach, based on kernel P system formalism, aimed at reassessing the space-time tradeoff, usually involved in membrane computing solutions, is investigated. Two models are introduced and assessed in order to find the potential benefits of each of them for solving the above problem, revealing also their limitations and providing hints for further improvements.

show abstract