By Topic

Fast Parallel Molecular Algorithms for DNA-Based Computation: Solving the Elliptic Curve Discrete Logarithm Problem over GF(2n)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kenli Li ; Coll. of Comput. & Commun., Hunan Univ., Changsha ; Shuting Zou ; Jin Xu

The analogs based on elliptic curve over finite fields of public-key crypto systems are algorithms that converts input data to an unrecognizable encryption and converts the unrecognizable data back into its original decryption form. The security of the elliptic curve public-key cryptosystem is based on the difficulty of the discrete logarithm problem on elliptic curve, especially over GF(2n), n isin Z+ . This paper demonstrates to find the discrete logarithm on elliptic curve, and is a breakthrough in basic biological operations using a molecular computer. In order to achieve this, we propose three DNA-based algorithms for parallel adder, parallel multiplier, and parallel getting inverse over GF(2n). The biological operation time of these algorithms are all polynomial with respect to n. This work indicates that the cryptosystems using public-key are perhaps insecure and also presents clear evidence of the ability of molecular computing to perform complicated mathematical operations.

Published in:

Frontiers in the Convergence of Bioscience and Information Technologies, 2007. FBIT 2007

Date of Conference:

11-13 Oct. 2007