Multiplication modulo (2n+1) using algorithmic self-assembly model and its application to international data encryption algorithm

One of the most important models of DNA computing which has much parallelism and high density storage is algorithmic tile self-assembly. Recent researches on this model have demonstrated that self-assembled architectures can be used to solve complex computational problems. In this paper, algorithmic self-assembly model is designed to carry out multiplication modulo (2 n+1) by executing three operations: addition operation, comparing operation and shift operation. Our method can be successfully performed multiplication modulo (2n +1) by using (H)(1) basic tile types in (H)(1) steps. Then, we discuss how to apply the self-assembled architectures for computing multiplication modulo (2n+1) to the well-known cryptosystem-International Data Encryption Algorithm (IDEA). Copyright © 2014 American Scientific Publishers All rights reserved.