DNA Computing Models
DNA Computing and Its Application to Information Security Field
ICNC '09 Proceedings of the 2009 Fifth International Conference on Natural Computation - Volume 06
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
Stateless multicounter 5' → 3' Watson---Crick automata: the deterministic case
Natural Computing: an international journal
Hi-index | 0.00 |
In today's world, the security of information is associated with valid and reliable encryption algorithms that we have used in our systems. Today, the latest methods for data encryption are based on DNA computing. In this paper, we consider a reliable data encryption algorithm (OTP) which is theoretically unbreakable, but it experiences some disadvantages in its algorithm. These drawbacks have prevented the common use of its scheme in modern cryptosystems. In this research, we include a logistic chaotic map as an input of OTP algorithm. So, the obtained result of `Matlab Simulation' could prove the efficiency of proposed algorithm in image encryption. In addition to the cryptography of text files, we can propose an interesting encryption algorithm based on a chaotic selection between original message DNA strands and OTP DNA strands. Finally, the empirical results of our proposed algorithm will be compared with AES Open SSl algorithm.