home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!usc!rpi!bu.edu!jade.tufts.edu!news.tufts.edu!sage.hnrc.tufts.edu!jerry
- From: jerry@nutmeg.hnrc.tufts.edu (Jerry Dallal)
- Newsgroups: sci.math.stat
- Subject: Re: random number generator
- Message-ID: <1992Jul29.143808.241@nutmeg.hnrc.tufts.edu>
- Date: 29 Jul 92 19:38:07 GMT
- References: <1126@kepler1.rentec.com> <1992Jul29.092934.23335@cl.cam.ac.uk> <1992Jul29.090353.237@nutmeg.hnrc.tufts.edu> <55413@mentor.cc.purdue.edu>
- Organization: USDA HNRC at Tufts University
- Lines: 21
-
- In article <55413@mentor.cc.purdue.edu>, hrubin@pop.stat.purdue.edu (Herman Rubin) writes:
- >
- > I would not accept anything with a short seed (say at least several
- > hundred bytes) as acceptable. Other than the believed cryptographically
- > strong Shamir and Blum-Miccaeli (sp?) procedures, which are extremely
- > costly, I know of none. The problem is at least moderate-term independence,
- > and correlations, periods, etc., do not answer the question.
- >
-
- Two questions of Professor Rubin:
-
- 1) What generator *would* you recommend?
-
- 2) The last time you generated pseudorandom numbers on a computer, what
- generator did you use?
-
-
- [Perhaps this should have been a REPLY rather than a FOLLOWUP because it carries
- on a dialogue by asking a question of a particular individual. I chose
- FOLLOWUP because RNGs seem to be of general interest. My apologies if
- I've committed a breach of etiquette.]
-