RST and NP-complete algorithms

Thread View: sci.crypt

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Stephen P. Masticola Fri, 30 Oct 1987 22:10

#3847

Author: 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

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads