Arithmetic computation using self-assembly of DNA tiles: Modular-square over finite field GF(2n)

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Tile assembly model is a highly distributed parallel model of DNA computing. This paper proposes how the tile assembly process could be used for computing the modular square, an operation combining square and reduction, over finite field GF(2n). In this molecular computing system, reduction is executed after the completion of square. The time complexity of this molecular computing system is Q(n) and the space complexity is Q(n2). This system requires 75 types of computation tiles and 9 types of boundary tiles.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 2013 IEEE International Conference on Embedded and Ubiquitous Computing, EUC 2013
PublisherIEEE Computer Society
Pages490-495
Number of pages6
ISBN (Print)9780769550886
DOIs
StatePublished - 2014
Event15th IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC 2013 - Zhangjiajie, Hunan, China
Duration: 13 Nov 201315 Nov 2013

Publication series

NameProceedings - 2013 IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 2013 IEEE International Conference on Embedded and Ubiquitous Computing, EUC 2013

Conference

Conference15th IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC 2013
Country/TerritoryChina
CityZhangjiajie, Hunan
Period13/11/1315/11/13

Keywords

  • DNA computing
  • Finite field GF(2n)
  • Modular-square
  • Tile assembly model

Fingerprint

Dive into the research topics of 'Arithmetic computation using self-assembly of DNA tiles: Modular-square over finite field GF(2n)'. Together they form a unique fingerprint.

Cite this