A DNA sticker algorithm for bit-substitution in a block cipher

Geng, Xin; Pan, Linqiang; Xu, Jin

doi:10.1016/j.jpdc.2008.06.002

Cited by 11 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are different ways to encode binary data [24,32,33]. Binary data can be encoded in DNA by using Oligonucleotide sequences or the alphabet.…”

Section: Related Workmentioning

confidence: 99%

A Method to Encrypt Information with DNA-Based Cryptography

Najaftorkaman¹,

Kazazi²

2015

IJCSDF

View full text Add to dashboard Cite

DNA cryptography is a relatively new paradigm that has attracted great interest in the field of information security. Although there are many problems in DNA cryptography, scientists are trying to solve them because they believe that, with the extraordinary information density and the vast parallelism that are inherent in DNA computers, it is possible to make a secure system. In this study, we primarily focus on modern cryptography, which is based on quantum and DNA cryptography. Furthermore, a novel method to encrypt data by using DNA-based cryptography is discussed. In our study, DNA coding technology is used to convert binary data to DNA strings. Finally, the proposed DNA cryptography algorithm's strength is evaluated based on the properties of DNA strands and probability theories.

show abstract

“…There are different ways to encode binary data [24,32,33]. Binary data can be encoded in DNA by using Oligonucleotide sequences or the alphabet.…”

Section: Related Workmentioning

confidence: 99%

A Method to Encrypt Information with DNA-Based Cryptography

Najaftorkaman¹,

Kazazi²

2015

IJCSDF

View full text Add to dashboard Cite

show abstract

“…The proposed algorithm was applied to the cycle left shift technique on a mass of binary strings and showed a complexity O(n) for all n-bit binary strings. The algorithm indicates the possibility of insecurity for blockcipher systems with a 64-bit key (Geng et al, 2008).…”

Section: Related Workmentioning

confidence: 99%

A Molecular Solution to the Three-Partition Problem

Nuser

2012

Journal of Information Technology Research

View full text Add to dashboard Cite

Given a set of numbers, the three-partition problem is to divide them into disjoint triplets that all have the same sum. The problem is NP-complete. This paper presents an algorithm to solve this problem using the biomolecular computing approach. The algorithm uses a distinctive encoding technique that depends on the numbers values which omits the need to an adder to find the sum. The algorithm is explained and an analysis of its complexity in terms of time, the number of strands, number of tubes, and the longest library strand used is presented. A simulation of the algorithm is implemented and tested. This algorithm further proves the ability of molecular computing in solving hard problems.

show abstract

“…Work in [3] proved the RSA cryptosystem could be decoded with the linear steps by designing five DNA-based algorithms. A DNA sticker algorithm for bit-substitution was proposed in [4] to indicate that block cipher systems with a 64-bit key were perhaps insecure.…”

Section: Introductionmentioning

confidence: 99%