Molecular solutions of the RSA public-key cryptosystem on a DNA-based computer

Chang, Weng-Long; Lin, Kun‐Wei; Chen, Ju-Chin; Wang, Chih-Chiang; Lu, Lai Chin; Guo, Minyi; Ho, Michael

doi:10.1007/s11227-011-0627-z

Cited by 14 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The RSA public-key cryptosystem is an algorithm that converts a plaintext to its corresponding cipher-text, and then converts the cipher-text back into its corresponding plain-text [2] RSA is a public-key cryptography algorithm developed based on the presumed difficulty of cracking the factorial of a large integer [3]. The plaintext space K=cipher text space C=Zm(The integer space which can mod M, its value range is 0 ~ n-1) First, Generating Keys (1) The two large enough and different prime numbers u and v, which should be kept secretly.…”

Section: The Implementation Of Rsa Algorithmmentioning

confidence: 99%

The Application of RSA Encryption Algorithm in the Hainan Rural Tourism Management Platform

Xie¹

2017

Proceedings of the 2017 2nd International Conference on Education, Sports, Arts and Management Engineering (ICESAME 2017)

View full text Add to dashboard Cite

With the development of information technology, such as Big Data, O2O, Cloud Computing, the Internet of Things and Artificial Intelligence, the Hainan Rural Tourism Wisdom Management Platform should provide complete, safe and available information resources. How to make the information correctly generated, stored and transmitted has become very important. The Hainan Rural Tourism Wisdom Management Platform will use RSA encryption algorithm for data encryption to ensure data security. Because the RSA encryption algorithm is a public key encryption algorithm, if the keys are enough long, the information encrypted by RSA algorithm is unable to be cracked, which has been recommended as the public key data encryption standard by ISO.

show abstract

Section: The Implementation Of Rsa Algorithmmentioning

confidence: 99%

The Application of RSA Encryption Algorithm in the Hainan Rural Tourism Management Platform

Xie¹

2017

Proceedings of the 2017 2nd International Conference on Education, Sports, Arts and Management Engineering (ICESAME 2017)

View full text Add to dashboard Cite

show abstract

“…Some typical DNA computing models, such as the Adleman-Lipton model [ 1 , 2 ], the sticker model [ 3 ], the restriction enzyme model [ 4 ], the self-assembly model [ 5 ], the hairpin model [ 6 ], and the surface-based model [ 7 ], have already been established. Based on these models, lots of papers have been written for designing DNA procedures and algorithms to solve various NP-complete problems [ 8 , 9 , 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 ]. In order to fully understand the power of biological computation, it is worthwhile to try to solve more kinds of computationally-intractable problems with the aid of DNA biologic operations.…”

Section: Introductionmentioning

confidence: 99%

A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing

Wang

Cao

et al. 2015

IJMS

View full text Add to dashboard Cite

The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m < n), such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP) complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.

show abstract

“…In [2], some DNA-based algorithms designed to solve the problem of discrete logarithms demonstrated that the Diffie-Hellman public-key cryptosystem were perhaps insecure. Work in [3] proved the RSA cryptosystem could be decoded with the linear steps by designing five DNA-based algorithms. A DNA sticker algorithm for bit-substitution was proposed in [4] to indicate that block cipher systems with a 64-bit key were perhaps insecure.…”

Section: Introductionmentioning

confidence: 99%