Efficient DNA sticker algorithms for DES

The data encryption standard (DES) is an algorithm with approximate 72 quadrillion possible keys. The security of the DES is based on the difficulty of picking out the right key after the 16-round nonlinear function operations. In this paper, we propose a concrete recursive sticker molecular algorithm to the DES. The molecular sticker algorithm includes three parts: initializing the key space with all possible keys, encryption and detecting the corresponding key. The essential operations required in DES are implemented by the molecular sticker functions. The short memory strands, tubes, enzymes needed by the molecular sticker algorithm are calculated and analyzed. Furthermore, this work indicates that the DES are perhaps insecure and also presents clear evidence of the ability of molecular computing to perform complicated operations.