Internet Privacy Guaranteed ad (POTP Jr.)
Peter Monta
pmonta at qualcomm.com
Wed Feb 21 11:40:33 PST 1996
> > [ 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 at qualcomm.com
Qualcomm, Inc./Globalstar
More information about the Testlist
mailing list