文章基本信息

标题：A DNA Sticker Algorithm for Parallel Reduction over Finite Field GF(2n)
本地全文：下载
作者：Yongnan Li ; Limin Xiao ; Li Ruan 等
期刊名称：International Journal of Grid and Distributed Computing
印刷版ISSN：2005-4262
出版年度：2013
卷号：6
期号：5
页码：17-28
出版社：SERSC
摘要：This paper proposes a DNA sticker algorithm for parallel reduction over finite field GF(2n). This algorithm is suitable for some specific finite fields defined withtrinomials or pentanomials. We use one binary finite field GF(2163) which is recommended by National Institute of Standards and Technology (NIST) to describe the details about our algorithm. The solution space of 2325cases could be figured out within 3059 DNA steps. This work also presents clear evidence of ability of DNA computing to perform complicated mathematic operations for elliptic curve cryptosystem over finite field GF(2n).
关键词：Parallel reduction; Sticker model; DNA computing; Finite field GF(2;n