Computer Science – Cryptography and Security
Scientific paper
2001-10-02
Computer Science
Cryptography and Security
8 pages, 8 figures, will be submitted to the GECCO-2002 Conference
Scientific paper
The early promises of DNA computing to deliver a massively parallel architecture well-suited to computationally hard problems have so far been largely unkept. Indeed, it is probably fair to say that only toy problems have been addressed experimentally. Recent experimental development on algorithmic self-assembly using DNA tiles seem to offer the most promising path toward a potentially useful application of the DNA computing concept. In this paper, we explore new geometries for algorithmic self-assembly, departing from those previously described in the literature. This enables us to carry out mathematical operations like binary multiplication or cyclic convolution product. We then show how to use the latter operation to implement an attack against the well-known public-key crypto system NTRU.
Pelletier Olivier
Weimerskirch Andre
No associations
LandOfFree
Algorithmic Self-Assembly of DNA Tiles and its Application to Cryptanalysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Algorithmic Self-Assembly of DNA Tiles and its Application to Cryptanalysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic Self-Assembly of DNA Tiles and its Application to Cryptanalysis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-60425