Re: Cryptographically random numbers

2006-03-07 Thread Gervasio Bernal
Tuvas wrote: > from os import urandom > def cstring(bytes): > ret='' > while(len(ret) c=os.urandom(1) > if c>'0' and c<'z': > ret=ret+c > return ret > > That should do it, though I bet there might be a more efficient way. I > don't know if that's the set of

Re: Cryptographically random numbers

2006-03-07 Thread Gervasio Bernal
Bryan Olson wrote: > Tuvas wrote: > >>Ahh, you are correct, that is a large bug... How about this one? > > > Much better. Do note the comments from Emile van Sebille and Paul > Rubin. There are some minor style and efficiency points, but it > looks reasonable. > > Incidentally, as of Python 2.4