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

Authors:
Ashish Choudhary;Kamala Krithivasan
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Chennai, India;Department of Computer Science and Engineering, Indian Institute of Technology, Chennai, India
Venue:
International Journal of Computer Mathematics
Year:
2009

Citing 8
Cited 0

The connection machine

The connection machine
Public-key cryptography

Public-key cryptography
Towards a new architecture for symbolic processing

AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Computing with membranes

Journal of Computer and System Sciences
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Networks of Parallel Language Processors

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Breaking DES using P systems

Theoretical Computer Science
Hybrid networks of evolutionary processors

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

Quantified Score

Hi-index	0.00

Visualization

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 pair, one can recover the DES key in a constant number of steps.