earticle

논문검색

Square over Finite Field GF(2n) using Self-Assembly of DNA Tiles

원문정보

Yongnan Li, Limin Xiao, Li Ruan, Ke Xie, Guangchao Yao

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.6 No.4 2013.07 pp.63-70
피인용수 : 0건 (자료제공 : 네이버학술정보)

초록

영어

The tile assembly model is a highly distributed parallel model of molecular computation. Plenty of experiments have proved that the simple binary arithmetic could be fulfilled by the process of self-assembly of DNA (deoxyribonucleic acid) tiles. Finite field GF(2n) is one of the most commonly used mathematic sets. A DNA computing system was designed based on the tile assembly model and applied to perform the operation of square over finite field GF(2n). One concrete example is proposed to show the details of our tile assembly system.

목차

Abstract
 1. Introduction
 2. Tile Assembly Model
 3. Square System
  3.1. Square over Finite Field GF(2n)
  3.2. Tile Assembly System of Square
 4. Complexity Discussion
 5. Conclusion
 Acknowledgments
 References

키워드

저자정보

  • Yongnan Li State Key Laboratory of Software Development Environment, Beihang University, School of Computer Science and Engineering, Beihang University
  • Limin Xiao State Key Laboratory of Software Development Environment, Beihang University, School of Computer Science and Engineering, Beihang University
  • Li Ruan State Key Laboratory of Software Development Environment, Beihang University, School of Computer Science and Engineering, Beihang University
  • Ke Xie State Key Laboratory of Software Development Environment, Beihang University, School of Computer Science and Engineering, Beihang University
  • Guangchao Yao State Key Laboratory of Software Development Environment, Beihang University, School of Computer Science and Engineering, Beihang University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.