Dissertation > Excellent graduate degree dissertation topics show

Researches on Several Cryptological Problems Based on DNA Computing by Self-Assembly

Author: ChenZhiHua
Tutor: XuJin
School: Huazhong University of Science and Technology
Course: System Analysis and Integration
Keywords: DNA computing Self-assembly model One-time Diffie-Hellman algorithm Of factoring large integers Data Encryption Standard algorithm (DES)
CLC: TN918.1
Type: PhD thesis
Year: 2009
Downloads: 264
Quote: 6
Read: Download Dissertation

Abstract

Cryptanalysis and cipher design is the most important part of the field of information security, and development related to various aspects of national security, economic security and financial security. Security of modern cryptography system is based on the exponential growth of key search time complexity, and the emerging massively parallel DNA computing have the characteristics of high-density storage and low power consumption, and presents a challenge not only to the traditional password security, at the same time new storage and encryption mode for the massive information storage. Experiments have shown that the DNA molecular self-assembly is a bottom-up effective mechanisms for nano-scale computing. One-dimensional and two-dimensional self-assembly of DNA computing tools, parallel computing capabilities has been recognized, and a lot of research. Has proven one-dimensional linear self-assembly with regular language computing power, and the computing power of two-dimensional self-assembly is Turing equivalent. Based on this background, this article the DNA computing Tile self-assembly model as the core, the password problem as the main object of study, DNA computing Tile self-assembly model in a variety of applications and their effectiveness password exploration and research, design and password system password algorithm to decipher Tile self-assembly model, based on DNA computing and quantitative analysis of the effectiveness of DNA computing for cryptanalysis and data encryption, time complexity, space complexity. This paper innovative content is as follows: First, the one-time pad cryptosystem based DNA computing. In this paper, DNA computing parallelism and massive storage capacity, the use of DNA computing Tile design and implementation of self-assembly model One-time password systems, and provide a new method for the storage and transmission of massive data encryption. The password system includes encryption subsystem ciphertext extraction subsystem, the key calculation subsystem and decryption subsystem, these four subsystems a complete password system. The use of biotechnology, to achieve a secure transmission of the secret key. Tile Type subsystem complexity (?) (1), the complexity of the computation time (?) (N). Finally, the one-time pad cipher system security analysis shows that the password system is implemented based on the Tile the model and biotechnology can ensure mass data storage and transmission security. Second, based on the programming ability of self-assembly model, designed to use the self-assembly model to decipher the Diffie-Hellman algorithm. First, according to the g mod p, g ^{2 mod p, ..., g ^{P-1 mod p obtained integer value build calculating Tile complete integer ordered self-assembled Tile system. Where p is a prime number, g is the primitive root of the prime number. By PCR and gel electrophoresis, can be read out different integers of g corresponding to the power, i.e. g of discrete values. By such a method, it can be a threat to the security of the Diffie-Hellman key exchange. The entire system using (?) (P) species Tile type, and (?) (P) of the assembly time to complete integer arrangement. This model for a finite number of digits of the Diffie-Hellman algorithm is effective. Tile species associated with the input bits linear, thus limiting the size of the Diffie-Hellman algorithm to decipher. Then the use of DNA computing self-assembly model packaging programming capabilities, design division self-assembly model, and make full use of DNA computing to distributed and parallel computing advantages assembly model embedded in the division since the divisor generation system to construct a non-deterministic large numbers decomposition of the self-assembly model is used to solve the large numbers factorization problem. Tile kinds complexity of the model (?) (1), the time complexity of (?) (N ^{2 ). DNA computing experiments allow at least 10 ^{18 divide self-assembly system simultaneous operations, the division system has the same dividend, but the divisor is randomly generated, vary. To solve the problem of detection of division after completion suppliers, embedded in the self-assembled model is decomposed in a non-deterministic Tarsus determine the system of discriminating whether the remainder is zero, the system can be labeled in a large number of results, the divisor can be divisible by the divisor, and extracted by marking The corresponding divisor and quotient, completed of factoring large integers. Finally, the analysis of this model of the non-deterministic self-assembled Tile successful search to the target probability of the divisor, and proved by increasing the amount of the DNA molecule participating in the operation so that the probability is close to 1. The biotechnology, the model can solve 2 ^{56 bit of factoring large integers. Further, the use of self-assembled bottom-up programming and packaging capacity, designed and implemented based on the model of self-assembly DES and 3DES encryption algorithms. Round function of the DES algorithm, including replacement, exchange, XOR, package and clever cascade, the cycle of the round function call. In order to be able to use the known plaintext - ciphertext attack DES algorithm to decipher the master key embedded in the DES algorithm model generation system, the use of self-assembly of parallel computing power of the same master key can be randomly generated encrypt known plaintext. To simplify the DES (SDES) as a template, and a detailed explanation of the design ideas and methods of the various functions, and then extended to the standard DES and 3DES algorithm. Master key generation system on the model of existing encryption algorithms, embedded, randomly generated master key, take advantage of the parallelism of DNA computing, using a known plaintext - ciphertext attack decipher SDES, DES and 3DES. Finally, biotechnology error rate and successfully deciphered DES and 3DES encryption algorithms relationship. As you can see from the results, the error rate decreases with the further improvement of biotechnology, completely self-assembly model can use known plaintext - ciphertext attack successfully deciphered DES and 3DES algorithm. Finally, the use of parallel computing and fluorescence imaging characteristics of DNA chips, use the the DNA biochip technologies, hybrid and digested build XOR function, and application of the technical analysis of the DES algorithm ability of anti-S box differential cryptanalysis. Fluorescence image, you can quickly and efficiently evaluate the statistical distribution of the S-box XOR output, enabling to determine the ability of anti differential cryptanalysis of S-box, providing the basis for improved DES security.}}}}}

Related Dissertations

CLC: > Industrial Technology > Radio electronics, telecommunications technology > Communicate > Confidentiality of communications and communications security > Theory
© 2012 www.DissertationTopic.Net Mobile