Skip Montanaro skip at pobox.com
Mon Jan 27 17:25:28 EST 2003

• Previous message (by thread): Generating Unique Keys
• Next message (by thread): Generating Unique Keys
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

    Chad> In this case, it depends on on the implementation of random().
    Chad> Python's default random.random() is NOT anywhere near
    Chad> unpredictable enough to be secure.  If you see a sequence of
    Chad> random numbers, it is possible (in principle) to 'solve' the seed
    Chad> and sequence, and start predicting the next random numbers.  The
    Chad> details typically amount to solving a linear difference equation
    Chad> (which is doable).

Is this also true for the new-in-2.3 random number generator (Mersenne
Twister)?  I'm not trying to pick nits with your arguments, just asking.  I
know nothing about cryptography or random number generation.

Skip

---

• Previous message (by thread): Generating Unique Keys
• Next message (by thread): Generating Unique Keys
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

More information about the Python-list mailing list