[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: useful additional procedure for random bytes?

This page is part of the web mail archives of SRFI 27 from before July 7th, 2015. The new archives for SRFI 27 contain all messages, not just those from before July 7th, 2015.

On Mon, Feb 18, 2002 at 01:21:08PM +0100, Bengt Kleberg wrote:
> greetings,
> 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.
Or perhaps a string of bytes.  Many Scheme systems support binary data 
in this fashion.


Attachment: pgpOcvAA9Ptg7.pgp
Description: PGP signature