From: Peter Monta <pmonta@qualcomm.com>
Date: Thu, 22 Feb 1996 03:40:33 +0800
To: cypherpunks@toad.com
Subject: Re: Internet Privacy Guaranteed ad (POTP Jr.)
In-Reply-To: <v01540b01ad50e8efff81@[193.239.225.200]>
Message-ID: <199602211851.KAA13160@mage.qualcomm.com>
MIME-Version: 1.0
Content-Type: text/plain


> > [ IPG Sales ]
> >
> >... any of the N to the 256th power possibile clear/plain text
> >messages/files.

Excuse me?  256^N.

> [ Clay Olbon ]
> PROOF:
> 
> For any message length N > 1, 2^N < N^256.

Excuse me?  2^N is not O(N^k).

Cypherpunks used to be a place where I could fairly reliably see
high-SNR commentary from real cryptographers/number theorists.
Now we have the blind replying to the blind's obfuscatory
nonsense, and the useful posts take some effort to find.

> Try learning some simple math before you try and sell crypto.

Surely it's not a requirement these days.

Peter Monta   pmonta@qualcomm.com
Qualcomm, Inc./Globalstar