Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

DNA Isolation

DNA Isolation

DNA isolation protocols can be fast and straightforward or complex and time-consuming depending on the type and quality of DNA required for further processing. For example, plasmid DNA extraction is a bit more complicated than genomic DNA extraction because of the need for an appropriate lysis method to separate plasmid DNA from gDNA during isolation. However, for specific applications, such as long-range DNA sequencing that require a good yield of high- quality DNA samples, we need to follow...

Maxam-Gilbert Sequencing

Maxam-Gilbert Sequencing

In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...

Sanger Sequencing

Sanger Sequencing

DNA sequencing is a fundamental technique that is routinely used in the biological sciences. This method can be applied to a range of questions at different scales - from the sequencing of a cloned DNA fragment or the study of a mutation in a gene up to whole-genome sequencing. However, despite the widespread use of sequencing today, it was not until 1977 that Fredrick Sanger and his collaborators developed the chain-termination method to decode DNA sequences. It relies on the separation of a...

Next-generation Sequencing

Next-generation Sequencing

The first human genome sequencing project cost $2.7 billion and was declared complete in 2003, after 15 years of international cooperation and collaboration between several research teams and funding agencies. Today, with the advent of next-generation sequencing technologies, the cost and time of sequencing a human genome have dropped over 100 fold.
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features.

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Advances in Yeast Glucan Particles for Oral Drug Delivery.

Polymers·2026

Same author

Application of Composite Raman Probes in Tumor Diagnosis and Imaging.

Polymers·2026

Same author

A Neural Time-Series Learning Method for Accelerating Free-Energy Perturbation and Rare-Event Molecular Dynamics Simulations.

Journal of chemical information and modeling·2026

Same author

CMIS: A Class-Aware Multi-Structure Instance Segmentation Model for Fetal Brain Ultrasound Images With Fuzzy Region-Based Constraints.

IEEE journal of biomedical and health informatics·2025

Same author

Development of potent JAK1/2 PROTAC degraders for the treatment of inflammatory bowel diseases.

European journal of medicinal chemistry·2025

Same author

Interactive Hybrid Rice Breeding with Parametric Dual Projection.

IEEE transactions on visualization and computer graphics·2025

Search research articles

Related Experiment Video

Updated: Jul 5, 2026

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

Published on: December 29, 2021

Fast parallel molecular algorithms for DNA-based computation: solving the elliptic curve discrete logarithm problem

Kenli Li¹, Shuting Zou, Jin Xv

¹Embedded System and Networking Laboratory, College of Computer and Communication, Hunan University, Changsha 410082, China.

Journal of Biomedicine & Biotechnology

|April 24, 2008

Summary

This study introduces a molecular computer to solve the elliptic curve discrete logarithm problem (ECDLP), potentially impacting public-key cryptography security. DNA-based algorithms demonstrate the feasibility of molecular computing for complex cryptographic challenges.

More Related Videos

Studying DNA Looping by Single-Molecule FRET

Studying DNA Looping by Single-Molecule FRET

Published on: June 28, 2014

Related Experiment Videos

Last Updated: Jul 5, 2026

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

Published on: December 29, 2021

Studying DNA Looping by Single-Molecule FRET

Studying DNA Looping by Single-Molecule FRET

Published on: June 28, 2014

Area of Science:

Computational Science
Cryptography
Molecular Computing

Background:

Elliptic curve cryptography (ECC) relies on the difficulty of the elliptic curve discrete logarithm problem (ECDLP) for security.
Solving ECDLP, especially over GF(2(n)), is computationally intensive for traditional computers.

Purpose of the Study:

To propose and demonstrate an effective method for solving the ECDLP using a molecular computer.
To explore the potential of molecular computing for advanced cryptographic computations.

Main Methods:

Development of three DNA-based algorithms: parallel adder, parallel multiplier, and parallel inverse over GF(2(n)).
Analysis of the biological operation time for these algorithms, showing polynomial time complexity with respect to n.

Main Results:

Demonstrated the principle that molecular computers can solve ECDLP.
The proposed DNA-based algorithms operate in polynomial time relative to n.
This research provides evidence for the potential of molecular computing in cryptography.

Conclusions:

Molecular computing offers a viable approach to tackle complex computational problems like ECDLP.
The feasibility of DNA-based algorithms suggests potential implications for the security of public-key cryptography.
This work represents a breakthrough in applied biological computation.