Sticker model is one of the basic computer models of filtering model which is part of
Non-Autonomous DNA computing models. This model inputs are represented by encoded one
of a double (single – double) strand of DNA molecules , which is annealed with a short
fraction of strings at some positions , and therefore these strands called memory complexes .
Since its inception, DNA computing has provided a highly efficient and energy efficient
technology for solving complete NP problems because of its really high data density and
inherent parallels. In this paper, we explain how to use the sticker model, which is one of the
types of molecular computations in DNA computing, to design an algorithm for coding
analysis of the coded text in an unsystematic cipher method. The cipher text is broken by
employing the idea of brute force attack, which works to represent all possible keys and then
try it to break the encrypted text until reaching the correct key from among the total keys group
representing by solution space. Theoretically, both the cipher text and all possible keys are
represented using memory complexes of the DNA strands . Then , using sticker operations , as
separation , combination , and proposed operation named length , we can remove the incorrect
keys from the solution space of memory complexes , by taking advantage of the parallel
processing of DNA computing , therefore this model is classified as filtering model