A molecular computation model to compute inversion over finite field GF(2n)

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

Abstract

With the advent of DNA computing, some traditional scientific disciplines present new developing orientations. One of them is DNA-based cryptography, a new developing interdisciplinary area which combines cryptography, mathematical modeling, biochemistry and molecular biology. There are some questions worth study that how to implement the arithmetic operations used in cryptosystem based on DNA computing. This paper proposes a DNA computing model to show how to calculate inversion over finite field GF(2n) with DNA self-assembly. 4567 types of computation tiles with 7 different functions assemble into the seed configuration with inputs to figure out the solution. The assembly time complexity is Q(n2) and the space complexity is Q(n4).

Original languageEnglish
Title of host publicationProceedings - 22nd IEEE International Conference on Parallel and Distributed Systems, ICPADS 2016
EditorsXiaofei Liao, Robert Lovas, Xipeng Shen, Ran Zheng
PublisherIEEE Computer Society
Pages1151-1156
Number of pages6
ISBN (Electronic)9781509044573
DOIs
StatePublished - 2 Jul 2016
Event22nd IEEE International Conference on Parallel and Distributed Systems, ICPADS 2016 - Wuhan, Hubei, China
Duration: 13 Dec 201616 Dec 2016

Publication series

NameProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
Volume0
ISSN (Print)1521-9097

Conference

Conference22nd IEEE International Conference on Parallel and Distributed Systems, ICPADS 2016
Country/TerritoryChina
CityWuhan, Hubei
Period13/12/1616/12/16

Keywords

  • DNA computing
  • Finite field GF(2n)
  • Inversion

Fingerprint

Dive into the research topics of 'A molecular computation model to compute inversion over finite field GF(2n)'. Together they form a unique fingerprint.

Cite this