Re: A Novel Radioactive Decay Algorithm in Cryptography

On Wed, 14 Sep 2005 11:22:00 -0700, Douglas Eagleson wrote:

> A long as your understanding is the issue I can re-explain a little.
>
> A common method of radioactive decay, key application is altered. A
> very short count time on the counter invalidates the method. A set of
> counts with the statistical distribution is required.
>
> And so the implication of the invalid, is the key. A true key is still
> applied, except it is the decay constant as the key.
>
> A transformation of the equation truely occurs because of the binomial
> function present. My algorithm is a trivial algorithm, but it
> identifies the change of the counting equation.
>
> A short time caused the random distribution to simply disappear.

Congratulations to whoever wrote this, but at least for my taste Eliza was
better. I don't think this gets close to passing the Turing test.

BTW, have you got some sort of pseudo-opponent? I have fond memories of
the "discussion" between Eliza and Parrot.

-- 
Mailman
----== Posted via Newsfeeds.Com - Unlimited-Uncensored-Secure Usenet News==----
http://www.newsfeeds.com The #1 Newsgroup Service in the World! 120,000+ Newsgroups
----= East and West-Coast Server Farms - Total Privacy via Encryption =----