Due to the characteristics of the newly developed DNA computing, many researchers are interested in this specialty. One advantage of DNA " Deoxyribonucleic acid" is that it has ability to resolve a Boolean circuit with various types of gates at the same time in a single level. Most of the prior models suffered from the limitations that each level of the circuit requests the gates to be of some kind. The model proposed in this work increases parallelism and reduces human intervention to a tremendous extent. When level-wise simulation is executed, the simulation for each model shows the decrease in the number of nitrogen bases used, which leads to the processing of the largest number of data with the ability to increase the length of a word, in addition to the adoption of the parallel principle of implementation. The model is designed on a mechanism which includes adder and multiplier.

No abstract

Due to the characteristics of Deoxyribonucleic acid DNA chain which contains a very wide range of parallelism mechanism, and the computing processing speed can arrive at 1 billion times per one second. It is worth only a billionth of a traditional computer. It became the focus of the attention of researchers in the field of encryption. The aim of this study is to find an efficient and safe algorithm for data encryption as well as decryption. A symmetric novel method is proposed in this paper depends on DNA encryption by applying a mixture of DNA oligonucleotide and new development of algorithm technology steps. It includes encoding each character to a predefined decimal number, converting it to its equivalent binary number and then converting it into DNA coding. Finally, converts each code of DNA to a number that represents a row and column numbers. Simulation all all text (words) is executed in parallel by using Visual Basic programming, obtained an excellent encoding result in terms of time because all the characters, so the algorithm is able to process the largest number of data, all of them encode at the same time. An efficient, fast and highly encoding scheme has been obtained due to the complete executing parallelism of the DNA-based algorithm.

No abstract

An optical parallel quaternary signed digit (QSD) two-dimensional array multiplier based on digit-decomposition (DDP) representation and duplication-shifting-superimposing algorithm is proposed in this paper. The multiplication operation is done in three steps; one for partial products generation and the other two steps perform accumulation to find the DDP planes of the final result array. QSD multiplication and addition rules are used to obtain a newly derived equations which are suitable for easy optical implementation using basic optical tools. Finally, simulation results are presented to validate the successful of the multiplication operation.