Fast parallel DNA-based algorithms for molecular computation: discrete logarithm

Authors:
Weng-Long Chang;Shu-Chien Huang;Kawuu Weicheng Lin;Michael (Shan-Hui) Ho
Affiliations:
Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung City, Taiwan, Republic of China 807-78;Department of Computer Science, National PingTung University of Education, Pingtung, Taiwan, Republic of China 900;Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung City, Taiwan, Republic of China 807-78;Computer Center and Institute of Electrical Engineering, National Taipei University, San Shia, Taiwan, Republic of China 237
Venue:
The Journal of Supercomputing
Year:
2011

Citing 14
Cited 1

A course in number theory and cryptography

A course in number theory and cryptography
Molecular computation of solutions to combinatorial problems

Science
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Solution of a Satisfiability Problem on a Gel-Based DNA Computer

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Towards solution of the set-splitting problem on gel-based DNA computing

Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing

Parallel Computing - Special issue: High-performance parallel bio-computing
On properties of bond-free DNA languages

Theoretical Computer Science
Theoretical and Experimental DNA Computation (Natural Computing Series)

Theoretical and Experimental DNA Computation (Natural Computing Series)
Multiplying with DNA

Natural Computing: an international journal
Cycles and communicating classes in membrane systems and molecular dynamics

Theoretical Computer Science
Autonomous programmable biomolecular devices using self-assembled DNA nanostructures

Communications of the ACM - ACM's plan to go online first
A Computer Algorithm for Calculating the Product AB Modulo M

IEEE Transactions on Computers
Thermodynamic Analysis of Interacting Nucleic Acid Strands

SIAM Review

A RGB image encryption algorithm based on DNA encoding and chaos map

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Diffie and Hellman (IEEE Trans. Inf. Theory 22(6):644---654, 1976) wrote the paper in which the concept of a trapdoor one-way function was first proposed. The Diffie---Hellman public-key cryptosystem is an algorithm that converts input data to an unrecognizable encryption, and converts the unrecognizable data back into its original decryption form. The security of the Diffie---Hellman public-key cryptosystem is based on the difficulty of solving the problem of discrete logarithms. In this paper, we demonstrate that basic biological operations can be applied to solve the problem of discrete logarithms. In order to achieve this, we propose DNA-based algorithms that formally verify our designed molecular solutions for solving the problem of discrete logarithms. Furthermore, this work indicates that public-key cryptosystems based on the difficulty of solving the problem of discrete logarithms are perhaps insecure.