RST and NP-complete algorithms

Article View: sci.crypt

Article #3847

#3847

From: Stephen P. Masticola
Date: Fri, 30 Oct 1987 22:10

15 lines
1107 bytes

This is my first posting to this group; I hope this isn't one of the
subjects that gets perpetually beaten into the ground.

I'm interested in finding out whether the RST encryption algorithm
(which is supposed to only be breakable in time exponentially related
to the key length) has been broken yet. I heard some time ago that the
trapdoor knapsack algorithm had been broken, but know no particulars.

Also, does anyone have any idea how much computer time is needed to
encrypt or decrypt using these systems?

Thanks, y'all!

- Steve

Technical Details

Message-ID: <1976@surfers.rutgers.edu>

Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!seismo!sundc!pitstop!sun!decwrl!labrea!rutgers!paul.rutgers.edu!masticol

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!seismo!sundc!pitstop!sun!decwrl!labrea!rutgers!paul.rutgers.edu!masticol
From: masticol@surfers.rutgers.edu (Stephen P. Masticola)
Newsgroups: sci.crypt
Subject: RST and NP-complete algorithms
Message-ID: <1976@surfers.rutgers.edu>
Date: Fri, 30-Oct-87 17:10:44 EST
Article-I.D.: surfers.1976
Posted: Fri Oct 30 17:10:44 1987
Date-Received: Wed, 4-Nov-87 23:29:45 EST
Organization: Rutgers Univ., New Brunswick, N.J.
Lines: 15
Keywords: Have they been broken?