Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons

Ganbaatar, Ganbat; Nyamdorj, Dugar; Cichon, Gordon; Ishdorj, Tseren-Onolt

doi:10.1007/s41965-021-00073-3

Cited by 17 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [22] the authors propose a new key agreement protocol based on SN P systems. In [8,10,11] the authors describe how to implement the RSA algorithm in the framework of membrane computing. One ingenious way of applying P systems is shown in [24] which presents an algorithm to break the RSA encryption.…”

Section: Related Workmentioning

confidence: 99%

Privacy-preserving Linear Computations in Spiking Neural P Systems

Plesa,

Gheorghe,

Ipate

2023

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Spiking Neural P systems are a class of membrane computing models inspired directly by biological neurons. Besides the theoretical progress made in this new computational model, there are also numerous applications of P systems in fields like formal verification, artificial intelligence, or cryptography. Motivated by all the use cases of SN P systems, in this paper, we present a new privacypreserving protocol that enables a client to compute a linear function using an SN P system hosted on a remote server. Our protocol allows the client to use the server to evaluate functions of the form t 1 k + t 2 without revealing t 1 ,t 2 or k and without the server knowing the result. We also present an SN P system to implement any linear function over natural numbers and some security considerations of our protocol in the honest-but-curious security model.

show abstract

Section: Related Workmentioning

confidence: 99%

Privacy-preserving Linear Computations in Spiking Neural P Systems

Plesa,

Gheorghe,

Ipate

2023

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…Many techniques for improving and altering security algorithms to estimate better security in the shortest time have been given in the literature [11][12][13][14][15][16][17][18][19][20][21][22][23]. In [11], a model combining the public Key RSA cryptography system with the Di e-Hellman (DH) key exchange is created to prevent the man-in-themiddle (MITM) attack.…”

Section: Related Workmentioning

confidence: 99%

“…In [21], RSA is a classical asymmetric encryption method signi cant in the privacy and security domain. Due to the di culty in breaking RSA, it is almost widely used wherever encryption is required: data transmission, digital signature, password exchange, banking, online shopping, and data secure storage, among other things.…”

Section: Related Workmentioning

confidence: 99%

The authors have requested that this preprint be removed from Research Square.

ElDin

El‐Sawy

Taha

2022

Preprint

View full text Add to dashboard Cite

In today's digital world, with the massive technological revolution that has taken place, more technologies and IoT devices are used in our lives. Most of these technologies are connected through a network. They generate vast amounts of data rapidly, resulting in zillions of digital information traveling over network communication. Maintaining strong and high security for any exchangeable data has become necessary. Networked information requires security and privacy. Various cryptographic algorithms are now available to secure messages and data being transmitted. Despite its simplicity, symmetric cryptography does not provide efficient authorization. Asymmetric cryptography is more secure than symmetric encryption because it provides all of the components of information security but takes more time. This paper discusses the two most widely used cryptography algorithms, RSA and Diffie Hellman, how they work, and how they will impact security and speed when converted into a single hybrid (MRSADH) calculation with appropriate modifications. The paper also presents an approach that uses public and private key encryption to improve cryptographic security despite reducing the mathematical equations, resulting in a shorter execution time.

show abstract

“…This allows to study both sequential and parallel solutions, and their complexity aspects. The paper [32] also uses a variation of spiking neural P systems, namely SN P systems based on HP/LP neurons. The authors use HP/LP neurons to build a Dual-rail type logic.…”

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

Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons

Cited by 17 publications

References 26 publications

Privacy-preserving Linear Computations in Spiking Neural P Systems

Privacy-preserving Linear Computations in Spiking Neural P Systems

The authors have requested that this preprint be removed from Research Square.

Breaking RSA Encryption Protocol with Kernel P Systems

Contact Info

Product

Resources

About