[HTML][HTML] Arithmetic computation using self-assembly of DNA tiles: subtraction and division

X Zhang, Y Wang, Z Chen, J Xu, G Cui - Progress in Natural Science, 2009 - Elsevier
Recently, experiments have demonstrated that simple binary arithmetic and logical
operations can be computed by the process of self-assembly of DNA tiles. In this paper, we …

Synthesis of stable 2D micro-assemblies of DNA tiles achieved via intrinsic curvatures in the skeleton of DNA duplexes coupled with the flexible support of the twisted …

MMFA Baig, X Gao, A Farid, AW Zia, M Abbas… - Applied …, 2023 - Springer
The science of DNA nanotechnology has led to the synthesis of size-controllable materials
with uniformed geometries at nano-and micro-scales. Herein, we proposed the double …

A new DNA-based model for finite field arithmetic

I Jirón, S Soto, S Marín, M Acosta, I Soto - Heliyon, 2019 - cell.com
Abstract A Galois field GF (pn) with p≥ 2 a prime number and n≥ 1 is a mathematical
structure widely used in Cryptography and Error Correcting Codes Theory. In this paper, we …

Parallel molecular computation of modular-multiplication with two same inputs over finite field GF (2n) using self-assembly of DNA tiles

Y Li, L Xiao, L Ruan - Computational Biology and Chemistry, 2014 - Elsevier
Two major advantages of DNA computing–huge memory capacity and high parallelism–are
being explored for large-scale parallel computing, mass data storage and cryptography. Tile …

[PDF][PDF] Square over finite field GF (2n) using self-assembly of DNA tiles

Y Li, L Xiao, L Ruan, K Xie, G Yao - International Journal of Hybrid …, 2013 - gvpress.com
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 …

A tile assembly model to calculate point-multiplication on conic curves over finite field GF (2n)

Y Li - 2020 IEEE Intl Conf on Parallel & Distributed …, 2020 - ieeexplore.ieee.org
Point-multiplication is the fundamental operation to construct discrete logarithm, the
intractability of which ensures the security of mathematical curves cryptography. This paper …

A DNA Computing System of Modular-Multiplication over Finite Field GF(2n)

Y Li, L Xiao, L Ruan, Z Zhang, D Li - International Conference on …, 2013 - Springer
The enormous parallel computing ability and high memory density of DNA computing bring
potential challenges and opportunities to traditional cryptography. Finite field GF (2 n) is one …

An improved molecular computing model of modular-multiplication over finite field GF (2n)

Y Li, L Xiao - 2016 17th International Conference on Parallel …, 2016 - ieeexplore.ieee.org
With the rapid development of DNA computing, there are some questions worth study that
how to implement the arithmetic operations used in cryptosystem based on DNA computing …

A Revised DNA Computing Model of Inversion and Division over Finite Field GF (2^ n)

Y Li - 2018 IEEE Intl Conf on Parallel & Distributed …, 2018 - ieeexplore.ieee.org
This paper proposes a DNA computing model to calculate both inversion and division over
finite field GF (2^ n). It is designed based on the previous works by combining modular …

Arithmetic computation in the tile assembly model: inversion over finite field GF (2n)

Y Li, L Xiao - 2014 IEEE Conference on Computational …, 2014 - ieeexplore.ieee.org
Tile assembly model is a formal model of DNA computing, which uses DNA, biochemistry
and molecular biology instead of the traditional silicon-based computer technologies. DNA …