Article View: sci.crypt
Article #4217Re: Random number generation
From: Andreas Nowatzyk
Date: Thu, 05 May 1988 08:42
Date: Thu, 05 May 1988 08:42
13 lines
974 bytes
974 bytes
The shift & xor - way of generating not-very-random numbers requires more that 2 taps for certain numbers of bits in order to get the max. period lengh (=2^n - 1). A table of polynomials that require only 2 terms can be found in Knuth's "The Art of Computer Programming", Vol.2. There is no 2-term solution for either 16, 32, 48 or 64 bit. (3, 17), (7, 31), (5, 47), (1, 63) are some nearby generators. -- -- Andreas Nowatzyk (DC5ZV) Carnegie-Mellon University Arpa-net: agn@unh.cs.cmu.edu Computer Science Department Usenet: ...!seismo!unh.cs.cmu.edu!agn
Technical Details
Message-ID:
<1610@pt.cs.cmu.edu>Path:
arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!bbn!rochester!pt.cs.cmu.edu!unh.cs.cmu.edu!agnReferences:
<89@lakart.UUCP>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!bbn!rochester!pt.cs.cmu.edu!unh.cs.cmu.edu!agn From: agn@unh.cs.cmu.edu (Andreas Nowatzyk) Newsgroups: sci.crypt Subject: Re: Random number generation Message-ID: <1610@pt.cs.cmu.edu> Date: 5 May 88 08:42:35 GMT References: <89@lakart.UUCP> Sender: netnews@pt.cs.cmu.edu Organization: Carnegie-Mellon University, CS/RI Lines: 13