On Mon, Dec 05, 2005 at 02:21:02AM -0600, Travis H. wrote:
On 12/4/05, Victor Duchovni [EMAIL PROTECTED] wrote:
Wrong threat model. The OP asked whether the system generating random
numbers can prove them to have been randomly generating to a passive
observer.
I didn't read it that way,
| There's another definition of randomness I'm aware of, namely that the
| bits are derived from independent samples taken from some sample space
| based on some fixed probability distribution, but that doesn't seem
| relevant unless you're talking about a HWRNG. As another poster
| pointed out,
On 12/3/05, Victor Duchovni [EMAIL PROTECTED] wrote:
Actually, this is inaccurate, proving the strength of AES or factoring is
difficult, and may never happen, we may even prove AES to be not secure
(in a broad sense) some day. Proving an RNG secure is *impossible*.
I'm not sure it's
On Sat, Dec 03, 2005 at 10:47:52PM -0600, Travis H. wrote:
On 12/3/05, Victor Duchovni [EMAIL PROTECTED] wrote:
Actually, this is inaccurate, proving the strength of AES or factoring is
difficult, and may never happen, we may even prove AES to be not secure
(in a broad sense) some day.
On Fri, 2005-12-02 at 11:54 +0100, Lee Parkes wrote:
So, the question is, how can the randomness of a PRNG be proved within
reasonable limits of time, processing availability and skill?
Cryptographic randomness? None.
Any one who considers arithmetical methods of producing random digits
is,
On Fri, Dec 02, 2005 at 11:54:03AM +0100, Lee Parkes wrote:
Hi,
Apologies if this has been asked before.
The company I work for has been asked to prove the randomness of a random
number generator. I assume they mean an PRNG, but knowing my employer it
could be anything.. I've turned the
On Fri, 2 Dec 2005, Lee Parkes wrote:
Hi,
Apologies if this has been asked before.
So, the question is, how can the randomness of a PRNG be proved within
reasonable limits of time, processing availability and skill?
Randomness is a quality that, intrinsically, cannot be proven. Period.
| Hi,
| Apologies if this has been asked before.
|
| The company I work for has been asked to prove the randomness of a random
| number generator. I assume they mean an PRNG, but knowing my employer it
| could be anything.. I've turned the work down on the basis of having
another
| gig that week.
Well, you just can't prove a PRNG is secure. It would be like proving that the
AES
is secure, or that factoring integers is hard. It just can't be done (aside
theoretical
discutions about P=NP).
What you can do, at most, is show that it has the same strength than a known
difficult problem.
On Fri, Dec 02, 2005 at 10:13:21PM -0200, [EMAIL PROTECTED] wrote:
Well, you just can't prove a PRNG is secure. It would be like proving that
the AES
is secure, or that factoring integers is hard. It just can't be done (aside
theoretical
discutions about P=NP).
Actually, this is
Hi,
Apologies if this has been asked before.
The company I work for has been asked to prove the randomness of a random
number generator. I assume they mean an PRNG, but knowing my employer it
could be anything.. I've turned the work down on the basis of having another
gig that week. However, it
11 matches
Mail list logo
