Breaking DES using P systems

Authors:
Shankara Narayanan Krishna;Raghavan Rama
Affiliations:
Department of Mathematics, Indian Institute of Technolooy, Madras, Chennai 600036, Tamilnadu, India;Department of Mathematics, Indian Institute of Technolooy, Madras, Chennai 600036, Tamilnadu, India
Venue:
Theoretical Computer Science
Year:
2003

Citing 7
Cited 4

Public-key cryptography

Public-key cryptography
Membrane computing with external output

Fundamenta Informaticae
Computing with membranes

Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Computing with Membranes: Variants with an Enhanced Membrane Handling

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
On the Power of Membrane Computing

On the Power of Membrane Computing
On Synchronization in P Systems

Fundamenta Informaticae

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

International Journal of Computer Mathematics
Membrane computing as a modeling framework: cellular systems case studies

SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Some notes on (mem)brane computation

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
An approach to computational complexity in membrane computing

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

Membrane systems, also called P systems, were introduced by Gh. Paun, as a new class of biologically inspired distributed computing models. Several variants of P systems were already shown to be computationally universal. One of these variants, introduced in Gh. Paun (J. Automata Languages Combin. 6 (1) (2001) 75), is able to solve SAT in linear time. In this paper, we show how this class of P systems (with membrane division) can theoretically break the most widely used cryptosystem, DES. We prove that given an arbitrary (plain-text, cipher-text) pair, one can recover the DES key in linear time with respect to the length of the key.