Visible to the public Parallel DNA Computing Model of Point-Doubling in Conic Curves Cryptosystem over Finite Field GF(2ˆn)

TitleParallel DNA Computing Model of Point-Doubling in Conic Curves Cryptosystem over Finite Field GF(2ˆn)
Publication TypeConference Paper
Year of Publication2019
AuthorsLi, Yongnan, Xiao, Limin
Conference Name2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)
ISBN Number978-1-7281-2058-4
Keywordsbiocomputing, Computational modeling, Conic Curves Cryptosystem, conic curves cryptosystem over finite held, cryptographic protocols, DNA, DNA computing, DNA cryptography, Elliptic curve cryptography, Elliptic curves, encoding, finite field GF, Finite Field GF(2ˆn), Galois fields, Human Behavior, mathematical curves, Metrics, parallel DNA computing model, Point doubling, point-addition, point-doubling, point-multiplication, Predictive Metrics, privacy, pubcrawl, public key cryptography, resilience, Resiliency, Self-assembly, Tile Assembly Model

DNA cryptography becomes a burgeoning new area of study along with the fast-developing of DNA computing and modern cryptography. Point-doubling, point-addition and point-multiplication are three fundamental point-operations to construct encryption protocols in some cryptosystem over mathematical curves such as elliptic curves and conic curves. This paper proposes a DNA computing model to calculate point-doubling in conic curves cryptosystem over finite held GF(2n). By decomposing and rearranging the computing steps of point-doubling, the assembly process could be fulfilled by using 8 different types of computation tiles performing different functions with 1097 encoding ways. This model could also figure out point-multiplication if its coefficient is 2k. The assembly time complexity is 2kn+n-k-1, and the space complexity is k2n2+kn2-k2n.

Citation Keyli_parallel_2019