[3185] in cryptography@c2.net mail archive
Re: Strong PRNG with AES or 3-DES
daemon@ATHENA.MIT.EDU (Mark Tillotson)
Mon Aug 10 15:29:42 1998
Date: Mon, 10 Aug 1998 19:39:06 +0100
From: Mark Tillotson <markt@harlequin.co.uk>
To: mdw@umich.edu
CC: aes@suburbia.net, coderpunks@toad.com, cryptography@c2.net
In-reply-to: <199808101028.GAA20426@quince.ifs.umich.edu> (message from Marcus
Watts on Mon, 10 Aug 98 06:28:25 -0400)
| Mok-Kong Shen <mok-kong.shen@stud.uni-muenchen.de> writes:
| >
| > I wonder whether a method that I employed in another situation of
| > pseudo-random number generation could be of some use to you. It is
| > addition of two pseudo-random real numbers streams (in my case in [0,1))
| > mod 1.
| > ...
| Addition mod 1 is not normally considered useful. Any integer
| modulo 1 is 0, and hence has zero information content.
But for _reals_, which is what is being talked about, it is perfectly
useful. The interval [0,1) would also be rather pointless in the
integral domain!
|
| Probably M.K.Shen meant to say "addition modulo 2", which is
| indeed a popular means of combining data in cryptography.
| ....
|
| -Marcus Watts
| UM ITD PD&D Umich Systems Group
Anyway, surely we are talking about rationals or floating-point, not
true reals?!? Just notating a random real number is computationally
infeasible, requiring infinite space.
__Mark
[ markt@harlequin.co.uk | http://www.harlequin.co.uk/ | +44(0)1954 785433 ]
[ personal homepage http://utter.chaos.org.uk/~markt/ | fax " " 785444 ]
