Image encryption using by DNA paterns

Today's computer-aided encryption techniques requires knowledge of very complicated and complex security measures. While each claims to be more secure than the previous, with every coming days we are witnessing how the previous passwords are broken. Therefore, based on the basic principles learned in theory, it is possible to say that any encryption method cannot become "unbreakable" and any password can break in a limited period of time. The number of encryption methods on images is increasing gradually. In this study, by means of a logistic map, we propose a simple and fast encryption algorithm to encrypt the images, using the Henon chaotic systems, logistic properties of random maps and DNA paterns. Also we modeled our algorithms with Turing machines. This algorithm is applied to both the black-and-white and color images. The results indicate a greater security of the proposed algorithm.