scispace - formally typeset
Search or ask a question
Journal Article•DOI•

Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules

01 Apr 2009-International Journal of Computer Mathematics (Taylor & Francis)-Vol. 86, Iss: 4, pp 567-576
TL;DR: It is shown that one can theoretically break the DES (data encryption standard), which is the most widely used cryptosystem, using NEPPS, and it is proved that, given an arbitrary pair, one can recover the DES key in a constant number of steps.
Abstract: In this paper we introduce a biologically inspired distributed computing model called networks of evolutionary processors with parallel string rewriting rules (NEPPS), which is a variation of the hybrid networks of evolutionary processors introduced by Martin-Vide et al. Such a network contains simple processors that are located in the nodes of a virtual graph. Each processor has strings (each string having multiple copies) and string rewriting rules. The rules are applied parallely on the strings. After the strings have been rewritten, they are communicated among the processors through filters. We show that we can theoretically break the DES (data encryption standard), which is the most widely used cryptosystem, using NEPPS. We prove that, given an arbitrary
Citations
More filters
Journal Article•DOI•
TL;DR: This paper design and simulate an engineered gene regulatory network to break S-DES which possesses a superior performance than the other methods based on DNA computing because it utilizes the power of massive parallelism of DNA molecules as well as capability of cellular division of bacterial cells which gives the proposed S- DES cracker system the flavour ofmassive parallel processing.
Abstract: In this paper we propose a theoretical method for breaking a block cipher based on a Feistel structure which is a variant of DES (S-DES) using one pair of (plaintext, ciphertext). Our scheme utilizes bacterial computing for the first time in cryptanalysis. For this reason, we design and simulate an engineered gene regulatory network to break S-DES which possesses a superior performance than the other methods based on DNA computing because it utilizes the power of massive parallelism of DNA molecules as well as capability of cellular division of bacterial cells which gives our proposed S-DES cracker system the flavour of massive parallel processing.

2 citations

01 Jan 2011
TL;DR: Four DNA/RNA computers which implement some modern security primitives such as the mental poker game, zero-knowledge proofs, signature schemes and public key cryptography are proposed.
Abstract: Summary DNA computing is promising in providing primitives of classical cryptography since it provides a variety of advantages over conventional silicon-based computing paradigms. These advantages include massive parallelism and data hiding capability which give it the computing flavor of Turing machine as well as the power of parallel processing which makes it suitable in different applications of classical cryptography. Although modern cryptography has expanded ideas of classical cryptography to include more rigorous security proofs and first class protocols based on concrete mathematics for ensuring secrecy in cryptographic protocols, the DNA computers have not followed the rapid pace by which cryptography community is going ahead and no biological computer has been designed to meet the growing demand of modern cryptographic protocols. For this reason, in this paper, we propose four DNA/RNA computers which implement some modern security primitives such as the mental poker game, zero-knowledge proofs, signature schemes and public key cryptography. Security protocols based on wetware for these primitives have been given which are intended for implementation in the wet lab using standard genetic engineering techniques on DNA and RNA molecules. Security proofs have been presented for each one of our proposed methods which complete the theoretical merits of our modern security protocols.

2 citations

Journal Article•DOI•
TL;DR: This paper utilizes, for the first time, the Turing-powerful potential of gene assembly procedure of ciliated protozoa into the real world computations and has a fewer number of steps than the other proposed schemes to break a cipher.
Abstract: In this paper we provide a novel approach for breaking a significant class of block ciphers, the so-called SPN ciphers, using the process of gene assembly in ciliates. Our proposed scheme utilizes, for the first time, the Turing-powerful potential of gene assembly procedure of ciliated protozoa into the real world computations and has a fewer number of steps than the other proposed schemes to break a cipher. We elaborate notions of formal language theory based on AIR systems, which can be thought of as a modified version of intramolecular scheme to model the ciliate bio-operations, for construction of building blocks necessary for breaking the cipher, and based on these nature-inspired constructions which are as powerful as Turing machines, we propose a theoretical approach for breaking SPN ciphers. Then, we simulate our proposed plan for breaking these ciphers on a sample block cipher based on this structure. Our results show that the proposed scheme has 51.5 percent improvement over the best previously proposed nature-inspired scheme for breaking a cipher.

1 citations

References
More filters
Journal Article•DOI•
Gheorghe Paun1•
TL;DR: It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.

2,327 citations


"Breaking the data encryption standa..." refers background in this paper

  • ...Grammar systems [1], distributed automata [2], membrane systems [3] and splicing systems [4] are examples of models defined to capture distribution and parallelism....

    [...]

Book•
01 Jan 1985
TL;DR: The Connection Machine describes a fundamentally different kind of computer that Daniel Hillis and others are now developing to perform tasks that no conventional, sequential machine can solve in a reasonable time.
Abstract: The Connection Machine describes a fundamentally different kind of computer. It offers a preview of a parallel processing computer that Daniel Hillis and others are now developing to perform tasks that no conventional, sequential machine can solve in a reasonable time.

2,124 citations

Book•
Arto Salomaa1•
01 Jan 1990
TL;DR: This book gives a broad overview of public-key cryptography - its essence and advantages, various public- key cryptosystems, and protocols - as well as a comprehensive introduction to classical cryptography and cryptoanalysis.
Abstract: Cryptography, secret writing, is enjoying a scientific renaissance following the seminal discovery in 1977 of public-key cryptography and applications in computers and communications. This book gives a broad overview of public-key cryptography - its essence and advantages, various public-key cryptosystems, and protocols - as well as a comprehensive introduction to classical cryptography and cryptoanalysis. The second edition has been revised and enlarged especially in its treatment of cryptographic protocols. From a review of the first edition: "This is a comprehensive review ... there can be no doubt that this will be accepted as a standard text. At the same time, it is clearly and entertainingly written ... and can certainly stand alone." Alex M. Andrew, Kybernetes, March 1992

1,000 citations

Journal Article•DOI•
TL;DR: The concept of self-assembly, which biological systems have evolved to form such structures as viruses, flagella, and microtubules, can lead the way to using DNA as the basis of nanorobotics.
Abstract: Computer scientists are joining forces with molecular biologists and chemists to explore the potential for computation using information-carrying biological polymers such as nucleic acids (DNA and RNA). DNA computing is a subset of molecular computing. The key feature of DNA for computing is its information content. The self-assembly properties of DNA suggest an indirect application to computing. The concept of self-assembly, which biological systems have evolved to form such structures as viruses, flagella, and microtubules (which serve as structural and motile components of cells), can lead the way to using DNA as the basis of nanorobotics.

444 citations

Book Chapter•DOI•
Gheorghe Paun1•
10 Jul 1995
TL;DR: This book investigates two major systems, cooperating distributed grammar systems and parallel communicating grammar systems, which concerns hierarchies with respect to different variants of cooperation, relations with classical formal language theory, syntactic parameters such as the number of components and their size, power of synchronization, and general notions generated from artificial intelligence.
Abstract: From the Publisher: This book investigates two major systems: firstly, cooperating distributed grammar systems, where the grammars work on one common sequential form and the cooperation is realized by the control of the sequence of active grammars; secondly, parallel communicating grammar systems, where each grammar works on its own sequential form and cooperation is done by means of communicating between grammars. The investigation concerns hierarchies with respect to different variants of cooperation, relations with classical formal language theory, syntactic parameters such as the number of components and their size, power of synchronization, and general notions generated from artificial intelligence.

395 citations


"Breaking the data encryption standa..." refers background in this paper

  • ...Grammar systems [1], distributed automata [2], membrane systems [3] and splicing systems [4] are examples of models defined to capture distribution and parallelism....

    [...]

  • ...Networks of language processors [8] are closely related to parallel communicating grammar systems [1], but here the main idea is to place a language generating device in any node of an underlying graph....

    [...]