useful additional procedure for random bytes? Bengt Kleberg 18 Feb 2002 12:21 UTC
the srfi states that 'random-integer-generator is the only way to get
random bits from a random generator'. since most cryptographical
algorithms use not integers, but arrays of bytes, would it not be
useful to also specify a procedure that generates this kind of random bits?
perhaps a list (of specified length), with integers 0-255 as items,
would be the most versatile value of such a procedure.