Name
Abstract | ||
|---|---|---|
The RSA public-key cryptosystem is an algorithm that converts a plain-text to its corresponding cipher-text, and then converts the cipher-text back into its corresponding plain-text. In this article, we propose five DNA-based algorithms—parallel adder, parallel subtractor, parallel multiplier, parallel comparator, and parallel modular arithmetic—that construct molecular solutions for any (plain-text, cipher-text) pair for the RSA public-key cryptosystem. Furthermore, we demonstrate that an eavesdropper can decode an encrypted message overheard with the linear steps in the size of the encrypted message overheard. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s11227-011-0627-z | The Journal of Supercomputing |
Keywords | Field | DocType |
The RSA public-key cryptosystem,Plain-text,Cipher-text,Biomolecular computing,DNA-based computing | Hybrid cryptosystem,Adder,Subtractor,Computer science,Benaloh cryptosystem,Parallel computing,Cryptosystem,Encryption,Ciphertext,Threshold cryptosystem,Distributed computing | Journal |
Volume | Issue | ISSN |
61 | 3 | 0920-8542 |
Citations | PageRank | References |
8 | 0.52 | 11 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weng-long Chang | 1 | 136 | 18.80 |
| Kawuu Weicheng Lin | 2 | 34 | 4.36 |
| Ju-Chin Chen | 3 | 42 | 4.48 |
| Chih-Chiang Wang | 4 | 24 | 5.90 |
| Lai Chin Lu | 5 | 8 | 1.54 |
| Minyi Guo | 6 | 3969 | 332.25 |
| Michael (Shan-Hui) Ho | 7 | 30 | 4.64 |