NODE 06e5c07bRe: OTP
paul@fatmans.demon.co.ukMon, 21 Oct 1996 08:31:15 -0700 (PDT)
> Can you explain to me how your one time pad algorithm is any better than
> encryption something with, say, RC4 or any other cipher using a key that
> is the same length as the seed for your PRNG?
Well for a start there is no possible cryptanalytic (rather than
brute force) attack on a one time pad, the system can be
mathematically proven to be secure with a very simple bit of
statistics.
Soemthing like RC4, even if the key were totally random and
unpredictable, and had as much, or more state than the message can
still be cryptanalysed possibly, although it is unlikely...
Datacomms Technologies web authoring and data security
Paul Bradley, Paul@fatmans.demon.co.uk
Paul@crypto.uk.eu.org, Paul@cryptography.uk.eu.org
Http://www.cryptography.home.ml.org/
Email for PGP public key, ID: 5BBFAEB1
"Don`t forget to mount a scratch monkey"
NODE 2e2feafcRe: OTP
"gweissman@spyrus.com" <gweissman@spyrus.com>Mon, 21 Oct 1996 17:02:10 -0700 (PDT)
paul@fatmans.demon.co.uk wrote:
>
> > Can you explain to me how your one time pad algorithm is any better than
> > encryption something with, say, RC4 or any other cipher using a key that
> > is the same length as the seed for your PRNG?
>
> Well for a start there is no possible cryptanalytic (rather than
> brute force) attack on a one time pad, the system can be
> mathematically proven to be secure with a very simple bit of
> statistics.
>
>
Ooops : there is no possible attack at all with a properly
implmented OTP cryptosystem. There is no keyspace to "brute-force"
search. Any message is as likely as any other. Check Schneier.
NODE c67f341bRe: OTP
dlv@bwalk.dm.com (Dr.Dimitri Vulis KOTM)Mon, 21 Oct 1996 20:20:11 -0700 (PDT)
Where do these idiots come from and why do they end up on this mailing list?
paul@fatmans.demon.co.uk writes:
>
> > Can you explain to me how your one time pad algorithm is any better than
> > encryption something with, say, RC4 or any other cipher using a key that
> > is the same length as the seed for your PRNG?
>
> Well for a start there is no possible cryptanalytic (rather than
> brute force) attack on a one time pad, the system can be
> mathematically proven to be secure with a very simple bit of
> statistics.
Please post your "mathematical proof" and explain what you mean by
a "brute force attack on a one time pad".
---
Dr.Dimitri Vulis KOTM
Brighton Beach Boardwalk BBS, Forest Hills, N.Y.: +1-718-261-2013, 14.4Kbps