What are good PRNG for calculators?
|
08-24-2014, 01:06 AM
Post: #19
|
|||
|
|||
RE: What are good PRNG for calculators?
(08-21-2014 09:56 PM)Paul Dale Wrote: The problem here is the exclusive or operations. Exactly. I think Namir needs to define "good" in this context, as different PRNG algorithms tend to have different properties. The linear congruential RNG's commonly used are fine for small simulations, Monte Carlo techniques, seeding games, etc. because they are a) simple and b) provide reasonable uniformity. But they're highly predictable. Linear Feedback Shift Registers, which depend upon lots of XOR'ing, have the additional property of being much less predictable, which makes them ideal for cryptographic applications. Fortunately, performing crypto on a scientific calculator is rarely required, and when it is done, it's rather like a singing dog - not remarkable because it's bad (slow), more remarkable that it's done at all. --- Les [http://www.lesbell.com.au] |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)