home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.crypt
- Path: sparky!uunet!ornl!rsg1.er.usgs.gov!darwin.sura.net!wupost!cs.utexas.edu!csc.ti.com!tilde.csc.ti.com!fstop.csc.ti.com!usenet
- From: jdailey@dadd.ti.com (Jim Dailey)
- Subject: Re: unpredictable random generators (terminology)
- Message-ID: <1992Nov19.170419.9575@csc.ti.com>
- Followup-To: sci.crypt
- Sender: usenet@csc.ti.com
- Nntp-Posting-Host: iccl1.asic.sc.ti.com
- Reply-To: jdailey@dadd.ti.com
- Organization: Design Automaton Div., Texas Instruments, Inc.
- Date: Thu, 19 Nov 1992 17:04:19 GMT
- Lines: 25
-
- pom@anke.imsd.uni-mainz.DE (Prof. Dr. Klaus Pommerening) writes:
- >In article <1992Nov12.171127.2162@ee.eng.ohio-state.edu>
- >> ... How about trying on a new acronym,
- >> too: URNG for Unpredicatble Random Number Generator, to distinguish RNGs
- >> that are designed for cryptography from the typical PRNGs?
- >
- >In the literature there is a certain confusion as to how call this sort
- >of (unpredictable) pseudo-random generators. Examples are:
- > - secure
- > - unpredictable
- > - cryptographically strong
- > - perfect
- >I prefer the latter term, because it is so short, and, more
- >important, the cryptographic strength implies that the generator
- >passes all efficient statistical tests -- truly perfect, isn't it?
-
- It's perfect with the exception of the ensuing acronymn conflict: does PRNG
- mean "Pseudo Random Number Generator" or "Perfect Random Number Generator"?
- I rather like URNG.
-
- ---
- Jim jdailey@dadd.ti.com
- TI pays absolutely no attention to me or my opinions; therefore,
- the foregoing posting cannot possibly represent TI's viewpoint.
-
-