2011
DOI: 10.1007/s11227-011-0627-z
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(3 citation statements)
references
References 20 publications
0
3
0
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 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%
“…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%
“…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%