Re: A Novel Radioactive Decay Algorithm in Cryptography

Whether through illiteracy of an English speaker, or a poor command of
English by a non-English speaker, this post is incomprehensible. Please
find someone to help you write better English.

The use of radioactive decay as a random number source is very well know
for many many many years. Whether you have some other point I do not know.

"Douglas Eagleson" <eaglesondouglas@yahoo.com> writes:

>A simulation of set theory applied to cryptography is this one. A set
>independent of either number or that to which the number is applied is
>the function.

>activity= (Activityzero)* exp(-lamda*time) where time is very very
>short.

>A number is calculated without relation to activity or time.

>And so the common radioactive decay function applied to crpytography is
>altered to the set theory outcome of this situation.

>A lamda truely becomes the number applied. And so the key becomes not
>the number of decays in the time, it becomes the choice of isotope's
>lamda.

>Making the rule of the atom decay technique a valid set of decays. An
>invalid short count-time decay algorithm is this invention. All the
>wording and math is the same, except the key appear the questionable
>identity.

>And so the choice of isotope and the lamda becomes the cause of the
>key. Using this apriori of key, the decay fraction and a constant is
>simulated by just lamda.

>A table of radioisotope decay constants are given and the key becomes
>the row, for example.

>And so the cryptographer can publish the words radiodecay, while the
>actual applied number is quite different.

>And the key is xored to the shuffled block, stating the algorithm.
>And the novel algorithm's name is ADIFFERENTIAL.

>Douglas Eagleson
>Gaithersburg, MD USA
Received on Thu Sep 29 21:54:44 2005