Using SHA1 as RNG

[Alejandro Lopez-Valencia]

On Sat, 15 Mar 2003 06:56:15 +0000 (UTC), Klaus Alexander Seistrup
<spam at magnetic-ink.dk> wrote:

>Paul Foley wrote:
>
>> Isn't there an MT-19937 random module?  Use that instead.
>> [If not, write one, but I think there is]
>
>Python 2.3 is using the MT-19937 PRNG.  I don't yet know if the
>python wrapper is easily portable to Python 2.2, but I'll give
>it a try.

If you can't, try with crng:

NAME
    crng - Random-number generators implemented as C extension types.

FILE
    /usr/lib/python2.2/site-packages/crng.dll

DESCRIPTION
    The generators are uniform in the open interval (0.0,1.0).
    Instance objects are callable; calls are equivalent to the 'next'
method.

        Random-number generator types
    ParkMiller    -- Park-Miller 'minimal standard'
    WichmannHill  -- Wichmann-Hill portable RNG (algorithm AS 183)
    LEcuyer       -- Pierre L'Ecuyer's MLCG of 1988
    Ranlux        -- Martin Luescher's RANLUX
    Taus88        -- three-component combined Tausworthe RNG by
L'Ecuyer
    MRG32k3a      -- combined multiple recursive 32-bit RNG by
L'Ecuyer
    MT19937       -- Mersenne Twister by Matsumoto and Nishimura

-- 
Alejandro Lopez-Valencia                          tora no shinden
python -c "print('ZHJhZHVsQDAwN211bmRvLmNvbQ=='.decode('base64'))"