跳到主要导航 跳到搜索 跳到主要内容

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

  • Chinese People's Public Security University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

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).

源语言英语
主期刊名Proceedings - 22nd IEEE International Conference on Parallel and Distributed Systems, ICPADS 2016
编辑Xiaofei Liao, Robert Lovas, Xipeng Shen, Ran Zheng
出版商IEEE Computer Society
1151-1156
页数6
ISBN(电子版)9781509044573
DOI
出版状态已出版 - 2 7月 2016
活动22nd IEEE International Conference on Parallel and Distributed Systems, ICPADS 2016 - Wuhan, Hubei, 中国
期限: 13 12月 201616 12月 2016

出版系列

姓名Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
0
ISSN(印刷版)1521-9097

会议

会议22nd IEEE International Conference on Parallel and Distributed Systems, ICPADS 2016
国家/地区中国
Wuhan, Hubei
时期13/12/1616/12/16

指纹

探究 'A molecular computation model to compute inversion over finite field GF(2n)' 的科研主题。它们共同构成独一无二的指纹。

引用此