Re: Random numbers

On May 15, 2012, at 11:14 AM, Christopher Kula wrote:

> And/or cryptographically secure random primes of a given bit length.
> 

Crypto algorithms that need unpredictable prime numbers should generate those values themselves, as part of their key generation process.   That ensures that each algorithm can get a prime number with exactly the properties that it needs, and it keeps the public API cleaner.  

David

> - Chris
> 
> On Tue, May 15, 2012 at 8:01 AM, Nadim <nadim@nadim.cc> wrote:
> Also, very relevant is window.crypto.getRandomValues: http://wiki.whatwg.org/wiki/Crypto
> 
> NK
> 
> On Tuesday, 15 May, 2012 at 10:59 AM, Nadim wrote:
> 
>> If we implement AES and SHA-2, we can use these as building blocks for a Fortuna RNG (spec. Bruce Schneier, Niels Ferguson.) I've already implemented Fortuna in JS and it's definitely feasible.
>> 
>> NK
>> 
>> On Tuesday, 15 May, 2012 at 10:52 AM, Philip Gladstone wrote:
>> 
>>> I believe that the crypto API should have a method for generating cryptographically secure random numbers. This is non-trivial to get right, but there is hardware support in some new chips for generating high quality random numbers. A uniform random number interface can abstract the platform differences and provide a uniform interface..
>>> 
>>> Philip
>>> --   
>>> Philip Gladstone
>>> Distinguished Engineer
>>> Product Development
>>> pgladstone@cisco.com
>>> Phone: +1 978-ZEN-TOAD (+1 978 936 8623)
>>> Google: +1 978 800 1010
>>> Ham radio: N1DQ
>>> 
>>> Attachments:
>>> - smime.p7s
>> 
> 
> 
> 
> 
> -- 
> Christopher Kula
> cjkula@gmail.com
>